./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7e46fc241e41202f704d8628c5c42d29c65298 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:28:56,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:28:56,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:28:56,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:28:56,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:28:56,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:28:56,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:28:56,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:28:56,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:28:56,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:28:56,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:28:56,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:28:56,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:28:56,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:28:56,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:28:56,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:28:56,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:28:56,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:28:56,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:28:56,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:28:56,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:28:56,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:28:56,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:28:56,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:28:56,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:28:56,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:28:56,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:28:56,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:28:56,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:28:56,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:28:56,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:28:56,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:28:56,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:28:56,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:28:56,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:28:56,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:28:56,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:28:56,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:28:56,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:28:56,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:28:56,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:28:56,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:28:56,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:28:56,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:28:56,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:28:56,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:28:56,831 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:28:56,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:28:56,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:28:56,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:28:56,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:28:56,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:28:56,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:28:56,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:28:56,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:28:56,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:28:56,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:28:56,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:28:56,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:28:56,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:28:56,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:28:56,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:28:56,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:28:56,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:28:56,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:28:56,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:28:56,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:28:56,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:28:56,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:28:56,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:28:56,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:28:56,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7e46fc241e41202f704d8628c5c42d29c65298 [2019-12-07 11:28:56,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:28:56,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:28:56,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:28:56,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:28:56,957 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:28:56,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix002_power.oepc.i [2019-12-07 11:28:57,000 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/data/a2e7b5f0b/9fdc3eef4d7045dab4516ffec83dfa3a/FLAG263071911 [2019-12-07 11:28:57,450 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:28:57,450 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/sv-benchmarks/c/pthread-wmm/mix002_power.oepc.i [2019-12-07 11:28:57,460 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/data/a2e7b5f0b/9fdc3eef4d7045dab4516ffec83dfa3a/FLAG263071911 [2019-12-07 11:28:57,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/data/a2e7b5f0b/9fdc3eef4d7045dab4516ffec83dfa3a [2019-12-07 11:28:57,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:28:57,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:28:57,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:28:57,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:28:57,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:28:57,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591cea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57, skipping insertion in model container [2019-12-07 11:28:57,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:28:57,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:28:57,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:28:57,775 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:28:57,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:28:57,863 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:28:57,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57 WrapperNode [2019-12-07 11:28:57,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:28:57,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:28:57,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:28:57,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:28:57,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:28:57,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:28:57,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:28:57,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:28:57,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... [2019-12-07 11:28:57,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:28:57,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:28:57,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:28:57,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:28:57,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:28:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:28:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:28:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:28:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:28:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:28:57,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:28:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:28:57,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:28:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:28:57,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:28:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:28:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:28:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:28:57,970 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:28:58,358 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:28:58,358 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:28:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:28:58 BoogieIcfgContainer [2019-12-07 11:28:58,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:28:58,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:28:58,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:28:58,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:28:58,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:28:57" (1/3) ... [2019-12-07 11:28:58,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786891a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:28:58, skipping insertion in model container [2019-12-07 11:28:58,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:28:57" (2/3) ... [2019-12-07 11:28:58,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786891a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:28:58, skipping insertion in model container [2019-12-07 11:28:58,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:28:58" (3/3) ... [2019-12-07 11:28:58,365 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_power.oepc.i [2019-12-07 11:28:58,372 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:28:58,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:28:58,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:28:58,378 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:28:58,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:28:58,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:28:58,470 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:28:58,470 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:28:58,470 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:28:58,470 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:28:58,470 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:28:58,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:28:58,471 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:28:58,471 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:28:58,484 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 11:28:58,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 11:28:58,545 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 11:28:58,545 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:28:58,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 11:28:58,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 11:28:58,603 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 11:28:58,603 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:28:58,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 11:28:58,624 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 11:28:58,625 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:29:01,607 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 11:29:01,782 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-07 11:29:01,782 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 11:29:01,785 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-07 11:29:16,534 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-07 11:29:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-07 11:29:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:29:16,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:16,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:29:16,540 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:16,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:16,543 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-07 11:29:16,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:16,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494380754] [2019-12-07 11:29:16,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:16,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494380754] [2019-12-07 11:29:16,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:16,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:29:16,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623263848] [2019-12-07 11:29:16,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:29:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:29:16,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:16,694 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-07 11:29:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:17,575 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-07 11:29:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:29:17,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:29:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:18,044 INFO L225 Difference]: With dead ends: 119349 [2019-12-07 11:29:18,044 INFO L226 Difference]: Without dead ends: 112420 [2019-12-07 11:29:18,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-07 11:29:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-07 11:29:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-07 11:29:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-07 11:29:26,354 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-07 11:29:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:26,354 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-07 11:29:26,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:29:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-07 11:29:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:29:26,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:26,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:26,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-07 11:29:26,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:26,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371219135] [2019-12-07 11:29:26,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:26,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371219135] [2019-12-07 11:29:26,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:26,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:29:26,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882663839] [2019-12-07 11:29:26,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:26,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:26,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:26,420 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-07 11:29:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:27,657 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-07 11:29:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:27,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:29:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:28,115 INFO L225 Difference]: With dead ends: 179210 [2019-12-07 11:29:28,115 INFO L226 Difference]: Without dead ends: 179161 [2019-12-07 11:29:28,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-07 11:29:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-07 11:29:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-07 11:29:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-07 11:29:39,438 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-07 11:29:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:39,438 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-07 11:29:39,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-07 11:29:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:29:39,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:39,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:39,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:39,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-07 11:29:39,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:39,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328178522] [2019-12-07 11:29:39,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:39,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328178522] [2019-12-07 11:29:39,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:39,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:29:39,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480242923] [2019-12-07 11:29:39,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:39,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:39,501 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 4 states. [2019-12-07 11:29:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:40,683 INFO L93 Difference]: Finished difference Result 228309 states and 925057 transitions. [2019-12-07 11:29:40,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:40,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:29:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:41,285 INFO L225 Difference]: With dead ends: 228309 [2019-12-07 11:29:41,285 INFO L226 Difference]: Without dead ends: 228253 [2019-12-07 11:29:41,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228253 states. [2019-12-07 11:29:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228253 to 192006. [2019-12-07 11:29:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192006 states. [2019-12-07 11:29:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192006 states to 192006 states and 791382 transitions. [2019-12-07 11:29:51,918 INFO L78 Accepts]: Start accepts. Automaton has 192006 states and 791382 transitions. Word has length 13 [2019-12-07 11:29:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:51,919 INFO L462 AbstractCegarLoop]: Abstraction has 192006 states and 791382 transitions. [2019-12-07 11:29:51,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 192006 states and 791382 transitions. [2019-12-07 11:29:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:29:51,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:51,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:51,927 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:51,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-07 11:29:51,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:51,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734172231] [2019-12-07 11:29:51,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:51,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734172231] [2019-12-07 11:29:51,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:51,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:29:51,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283746229] [2019-12-07 11:29:51,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:29:51,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:29:51,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:51,987 INFO L87 Difference]: Start difference. First operand 192006 states and 791382 transitions. Second operand 5 states. [2019-12-07 11:29:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:53,388 INFO L93 Difference]: Finished difference Result 261525 states and 1067824 transitions. [2019-12-07 11:29:53,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:29:53,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 11:29:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:54,063 INFO L225 Difference]: With dead ends: 261525 [2019-12-07 11:29:54,064 INFO L226 Difference]: Without dead ends: 261525 [2019-12-07 11:29:54,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:30:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261525 states. [2019-12-07 11:30:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261525 to 219155. [2019-12-07 11:30:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219155 states. [2019-12-07 11:30:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219155 states to 219155 states and 902019 transitions. [2019-12-07 11:30:07,982 INFO L78 Accepts]: Start accepts. Automaton has 219155 states and 902019 transitions. Word has length 16 [2019-12-07 11:30:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:07,983 INFO L462 AbstractCegarLoop]: Abstraction has 219155 states and 902019 transitions. [2019-12-07 11:30:07,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 219155 states and 902019 transitions. [2019-12-07 11:30:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:30:07,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:07,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:07,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1841081636, now seen corresponding path program 1 times [2019-12-07 11:30:07,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:07,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363802105] [2019-12-07 11:30:07,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:08,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363802105] [2019-12-07 11:30:08,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:08,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:30:08,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694659273] [2019-12-07 11:30:08,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:08,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:08,052 INFO L87 Difference]: Start difference. First operand 219155 states and 902019 transitions. Second operand 3 states. [2019-12-07 11:30:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:09,346 INFO L93 Difference]: Finished difference Result 206599 states and 841454 transitions. [2019-12-07 11:30:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:09,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:30:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:09,883 INFO L225 Difference]: With dead ends: 206599 [2019-12-07 11:30:09,883 INFO L226 Difference]: Without dead ends: 206599 [2019-12-07 11:30:09,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206599 states. [2019-12-07 11:30:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206599 to 203319. [2019-12-07 11:30:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203319 states. [2019-12-07 11:30:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203319 states to 203319 states and 829292 transitions. [2019-12-07 11:30:21,705 INFO L78 Accepts]: Start accepts. Automaton has 203319 states and 829292 transitions. Word has length 18 [2019-12-07 11:30:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:21,706 INFO L462 AbstractCegarLoop]: Abstraction has 203319 states and 829292 transitions. [2019-12-07 11:30:21,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 203319 states and 829292 transitions. [2019-12-07 11:30:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:30:21,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:21,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:21,717 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1116134768, now seen corresponding path program 1 times [2019-12-07 11:30:21,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:21,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732952084] [2019-12-07 11:30:21,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:21,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732952084] [2019-12-07 11:30:21,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:21,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:30:21,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449963460] [2019-12-07 11:30:21,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:21,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:21,754 INFO L87 Difference]: Start difference. First operand 203319 states and 829292 transitions. Second operand 3 states. [2019-12-07 11:30:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:21,887 INFO L93 Difference]: Finished difference Result 37471 states and 120568 transitions. [2019-12-07 11:30:21,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:21,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:30:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:21,937 INFO L225 Difference]: With dead ends: 37471 [2019-12-07 11:30:21,937 INFO L226 Difference]: Without dead ends: 37471 [2019-12-07 11:30:21,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37471 states. [2019-12-07 11:30:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37471 to 37471. [2019-12-07 11:30:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37471 states. [2019-12-07 11:30:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37471 states to 37471 states and 120568 transitions. [2019-12-07 11:30:22,573 INFO L78 Accepts]: Start accepts. Automaton has 37471 states and 120568 transitions. Word has length 18 [2019-12-07 11:30:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:22,573 INFO L462 AbstractCegarLoop]: Abstraction has 37471 states and 120568 transitions. [2019-12-07 11:30:22,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 37471 states and 120568 transitions. [2019-12-07 11:30:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:30:22,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:22,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:22,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-07 11:30:22,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:22,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630061632] [2019-12-07 11:30:22,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:22,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630061632] [2019-12-07 11:30:22,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:22,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:22,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745841099] [2019-12-07 11:30:22,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:22,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:30:22,635 INFO L87 Difference]: Start difference. First operand 37471 states and 120568 transitions. Second operand 6 states. [2019-12-07 11:30:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:23,236 INFO L93 Difference]: Finished difference Result 57567 states and 180868 transitions. [2019-12-07 11:30:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:30:23,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 11:30:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:23,316 INFO L225 Difference]: With dead ends: 57567 [2019-12-07 11:30:23,317 INFO L226 Difference]: Without dead ends: 57560 [2019-12-07 11:30:23,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:30:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57560 states. [2019-12-07 11:30:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57560 to 37220. [2019-12-07 11:30:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37220 states. [2019-12-07 11:30:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37220 states to 37220 states and 119129 transitions. [2019-12-07 11:30:24,378 INFO L78 Accepts]: Start accepts. Automaton has 37220 states and 119129 transitions. Word has length 22 [2019-12-07 11:30:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:24,378 INFO L462 AbstractCegarLoop]: Abstraction has 37220 states and 119129 transitions. [2019-12-07 11:30:24,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:30:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37220 states and 119129 transitions. [2019-12-07 11:30:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:30:24,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:24,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:24,386 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-07 11:30:24,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:24,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325746961] [2019-12-07 11:30:24,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:24,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325746961] [2019-12-07 11:30:24,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:24,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:24,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901516148] [2019-12-07 11:30:24,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:24,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:30:24,459 INFO L87 Difference]: Start difference. First operand 37220 states and 119129 transitions. Second operand 6 states. [2019-12-07 11:30:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:25,010 INFO L93 Difference]: Finished difference Result 54887 states and 172045 transitions. [2019-12-07 11:30:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:30:25,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 11:30:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:25,088 INFO L225 Difference]: With dead ends: 54887 [2019-12-07 11:30:25,089 INFO L226 Difference]: Without dead ends: 54874 [2019-12-07 11:30:25,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:30:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54874 states. [2019-12-07 11:30:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54874 to 45327. [2019-12-07 11:30:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45327 states. [2019-12-07 11:30:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45327 states to 45327 states and 144470 transitions. [2019-12-07 11:30:25,930 INFO L78 Accepts]: Start accepts. Automaton has 45327 states and 144470 transitions. Word has length 25 [2019-12-07 11:30:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:25,930 INFO L462 AbstractCegarLoop]: Abstraction has 45327 states and 144470 transitions. [2019-12-07 11:30:25,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:30:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45327 states and 144470 transitions. [2019-12-07 11:30:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:30:25,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:25,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:25,942 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-07 11:30:25,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:25,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106509929] [2019-12-07 11:30:25,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:25,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106509929] [2019-12-07 11:30:25,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:25,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:25,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115134809] [2019-12-07 11:30:25,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:25,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:25,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:25,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:25,965 INFO L87 Difference]: Start difference. First operand 45327 states and 144470 transitions. Second operand 3 states. [2019-12-07 11:30:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:26,159 INFO L93 Difference]: Finished difference Result 64967 states and 204237 transitions. [2019-12-07 11:30:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:26,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 11:30:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:26,256 INFO L225 Difference]: With dead ends: 64967 [2019-12-07 11:30:26,256 INFO L226 Difference]: Without dead ends: 64967 [2019-12-07 11:30:26,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64967 states. [2019-12-07 11:30:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64967 to 50523. [2019-12-07 11:30:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50523 states. [2019-12-07 11:30:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50523 states to 50523 states and 159451 transitions. [2019-12-07 11:30:27,486 INFO L78 Accepts]: Start accepts. Automaton has 50523 states and 159451 transitions. Word has length 27 [2019-12-07 11:30:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:27,486 INFO L462 AbstractCegarLoop]: Abstraction has 50523 states and 159451 transitions. [2019-12-07 11:30:27,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50523 states and 159451 transitions. [2019-12-07 11:30:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:30:27,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:27,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:27,501 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:27,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-07 11:30:27,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:27,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941373946] [2019-12-07 11:30:27,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:27,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941373946] [2019-12-07 11:30:27,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:27,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:27,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292394146] [2019-12-07 11:30:27,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:27,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:27,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:27,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:30:27,541 INFO L87 Difference]: Start difference. First operand 50523 states and 159451 transitions. Second operand 6 states. [2019-12-07 11:30:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:28,004 INFO L93 Difference]: Finished difference Result 71197 states and 220410 transitions. [2019-12-07 11:30:28,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:30:28,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 11:30:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:28,103 INFO L225 Difference]: With dead ends: 71197 [2019-12-07 11:30:28,103 INFO L226 Difference]: Without dead ends: 71155 [2019-12-07 11:30:28,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:30:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71155 states. [2019-12-07 11:30:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71155 to 52480. [2019-12-07 11:30:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52480 states. [2019-12-07 11:30:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52480 states to 52480 states and 165372 transitions. [2019-12-07 11:30:29,514 INFO L78 Accepts]: Start accepts. Automaton has 52480 states and 165372 transitions. Word has length 27 [2019-12-07 11:30:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:29,514 INFO L462 AbstractCegarLoop]: Abstraction has 52480 states and 165372 transitions. [2019-12-07 11:30:29,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:30:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 52480 states and 165372 transitions. [2019-12-07 11:30:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:30:29,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:29,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:29,532 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1195565268, now seen corresponding path program 1 times [2019-12-07 11:30:29,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:29,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529817717] [2019-12-07 11:30:29,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:29,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529817717] [2019-12-07 11:30:29,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:29,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:30:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889149853] [2019-12-07 11:30:29,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:29,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:29,563 INFO L87 Difference]: Start difference. First operand 52480 states and 165372 transitions. Second operand 3 states. [2019-12-07 11:30:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:29,711 INFO L93 Difference]: Finished difference Result 52427 states and 165214 transitions. [2019-12-07 11:30:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:29,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:30:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:29,789 INFO L225 Difference]: With dead ends: 52427 [2019-12-07 11:30:29,789 INFO L226 Difference]: Without dead ends: 52427 [2019-12-07 11:30:29,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52427 states. [2019-12-07 11:30:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52427 to 52427. [2019-12-07 11:30:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52427 states. [2019-12-07 11:30:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52427 states to 52427 states and 165214 transitions. [2019-12-07 11:30:30,662 INFO L78 Accepts]: Start accepts. Automaton has 52427 states and 165214 transitions. Word has length 29 [2019-12-07 11:30:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:30,662 INFO L462 AbstractCegarLoop]: Abstraction has 52427 states and 165214 transitions. [2019-12-07 11:30:30,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 52427 states and 165214 transitions. [2019-12-07 11:30:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:30:30,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:30,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:30,682 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash -803985333, now seen corresponding path program 1 times [2019-12-07 11:30:30,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:30,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703109937] [2019-12-07 11:30:30,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:30,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703109937] [2019-12-07 11:30:30,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:30,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:30,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404929656] [2019-12-07 11:30:30,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:30,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:30,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:30,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:30,712 INFO L87 Difference]: Start difference. First operand 52427 states and 165214 transitions. Second operand 4 states. [2019-12-07 11:30:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:30,782 INFO L93 Difference]: Finished difference Result 20298 states and 61140 transitions. [2019-12-07 11:30:30,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:30,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 11:30:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:30,803 INFO L225 Difference]: With dead ends: 20298 [2019-12-07 11:30:30,804 INFO L226 Difference]: Without dead ends: 20298 [2019-12-07 11:30:30,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20298 states. [2019-12-07 11:30:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20298 to 18891. [2019-12-07 11:30:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18891 states. [2019-12-07 11:30:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18891 states to 18891 states and 56917 transitions. [2019-12-07 11:30:31,076 INFO L78 Accepts]: Start accepts. Automaton has 18891 states and 56917 transitions. Word has length 30 [2019-12-07 11:30:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:31,076 INFO L462 AbstractCegarLoop]: Abstraction has 18891 states and 56917 transitions. [2019-12-07 11:30:31,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18891 states and 56917 transitions. [2019-12-07 11:30:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:30:31,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:31,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:31,089 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-07 11:30:31,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:31,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582545948] [2019-12-07 11:30:31,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:31,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582545948] [2019-12-07 11:30:31,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:31,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:31,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190137360] [2019-12-07 11:30:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:30:31,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:30:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:30:31,142 INFO L87 Difference]: Start difference. First operand 18891 states and 56917 transitions. Second operand 7 states. [2019-12-07 11:30:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:31,829 INFO L93 Difference]: Finished difference Result 26150 states and 76780 transitions. [2019-12-07 11:30:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:30:31,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 11:30:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:31,857 INFO L225 Difference]: With dead ends: 26150 [2019-12-07 11:30:31,857 INFO L226 Difference]: Without dead ends: 26150 [2019-12-07 11:30:31,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:30:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26150 states. [2019-12-07 11:30:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26150 to 18342. [2019-12-07 11:30:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18342 states. [2019-12-07 11:30:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18342 states to 18342 states and 55320 transitions. [2019-12-07 11:30:32,194 INFO L78 Accepts]: Start accepts. Automaton has 18342 states and 55320 transitions. Word has length 33 [2019-12-07 11:30:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,194 INFO L462 AbstractCegarLoop]: Abstraction has 18342 states and 55320 transitions. [2019-12-07 11:30:32,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:30:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18342 states and 55320 transitions. [2019-12-07 11:30:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:30:32,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:32,209 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-07 11:30:32,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175044623] [2019-12-07 11:30:32,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:32,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175044623] [2019-12-07 11:30:32,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:32,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:30:32,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540641474] [2019-12-07 11:30:32,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:32,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:32,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:32,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:32,243 INFO L87 Difference]: Start difference. First operand 18342 states and 55320 transitions. Second operand 3 states. [2019-12-07 11:30:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:32,300 INFO L93 Difference]: Finished difference Result 18342 states and 54645 transitions. [2019-12-07 11:30:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:32,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 11:30:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:32,320 INFO L225 Difference]: With dead ends: 18342 [2019-12-07 11:30:32,320 INFO L226 Difference]: Without dead ends: 18342 [2019-12-07 11:30:32,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18342 states. [2019-12-07 11:30:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18342 to 18068. [2019-12-07 11:30:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18068 states. [2019-12-07 11:30:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 53877 transitions. [2019-12-07 11:30:32,575 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 53877 transitions. Word has length 41 [2019-12-07 11:30:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,575 INFO L462 AbstractCegarLoop]: Abstraction has 18068 states and 53877 transitions. [2019-12-07 11:30:32,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 53877 transitions. [2019-12-07 11:30:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:30:32,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:32,590 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1951112096, now seen corresponding path program 1 times [2019-12-07 11:30:32,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620781515] [2019-12-07 11:30:32,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:32,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620781515] [2019-12-07 11:30:32,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:32,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:32,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154755595] [2019-12-07 11:30:32,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:32,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:32,634 INFO L87 Difference]: Start difference. First operand 18068 states and 53877 transitions. Second operand 5 states. [2019-12-07 11:30:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:32,701 INFO L93 Difference]: Finished difference Result 16581 states and 50621 transitions. [2019-12-07 11:30:32,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:30:32,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 11:30:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:32,719 INFO L225 Difference]: With dead ends: 16581 [2019-12-07 11:30:32,720 INFO L226 Difference]: Without dead ends: 16581 [2019-12-07 11:30:32,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16581 states. [2019-12-07 11:30:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16581 to 14879. [2019-12-07 11:30:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14879 states. [2019-12-07 11:30:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14879 states to 14879 states and 45615 transitions. [2019-12-07 11:30:32,949 INFO L78 Accepts]: Start accepts. Automaton has 14879 states and 45615 transitions. Word has length 42 [2019-12-07 11:30:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,949 INFO L462 AbstractCegarLoop]: Abstraction has 14879 states and 45615 transitions. [2019-12-07 11:30:32,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14879 states and 45615 transitions. [2019-12-07 11:30:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:30:32,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:32,965 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash -265654181, now seen corresponding path program 1 times [2019-12-07 11:30:32,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120240051] [2019-12-07 11:30:32,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:33,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120240051] [2019-12-07 11:30:33,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:33,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:33,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369405186] [2019-12-07 11:30:33,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:33,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:33,003 INFO L87 Difference]: Start difference. First operand 14879 states and 45615 transitions. Second operand 3 states. [2019-12-07 11:30:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:33,062 INFO L93 Difference]: Finished difference Result 19127 states and 57596 transitions. [2019-12-07 11:30:33,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:33,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 11:30:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:33,080 INFO L225 Difference]: With dead ends: 19127 [2019-12-07 11:30:33,081 INFO L226 Difference]: Without dead ends: 19127 [2019-12-07 11:30:33,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19127 states. [2019-12-07 11:30:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19127 to 14697. [2019-12-07 11:30:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14697 states. [2019-12-07 11:30:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14697 states to 14697 states and 44435 transitions. [2019-12-07 11:30:33,325 INFO L78 Accepts]: Start accepts. Automaton has 14697 states and 44435 transitions. Word has length 66 [2019-12-07 11:30:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:33,325 INFO L462 AbstractCegarLoop]: Abstraction has 14697 states and 44435 transitions. [2019-12-07 11:30:33,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14697 states and 44435 transitions. [2019-12-07 11:30:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:30:33,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:33,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:33,337 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1064025687, now seen corresponding path program 1 times [2019-12-07 11:30:33,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:33,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905850816] [2019-12-07 11:30:33,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:33,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905850816] [2019-12-07 11:30:33,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:33,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:30:33,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077812490] [2019-12-07 11:30:33,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:33,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:33,378 INFO L87 Difference]: Start difference. First operand 14697 states and 44435 transitions. Second operand 3 states. [2019-12-07 11:30:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:33,448 INFO L93 Difference]: Finished difference Result 17566 states and 53186 transitions. [2019-12-07 11:30:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:33,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 11:30:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:33,466 INFO L225 Difference]: With dead ends: 17566 [2019-12-07 11:30:33,466 INFO L226 Difference]: Without dead ends: 17566 [2019-12-07 11:30:33,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2019-12-07 11:30:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 13933. [2019-12-07 11:30:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13933 states. [2019-12-07 11:30:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13933 states to 13933 states and 42483 transitions. [2019-12-07 11:30:33,695 INFO L78 Accepts]: Start accepts. Automaton has 13933 states and 42483 transitions. Word has length 66 [2019-12-07 11:30:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:33,695 INFO L462 AbstractCegarLoop]: Abstraction has 13933 states and 42483 transitions. [2019-12-07 11:30:33,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 13933 states and 42483 transitions. [2019-12-07 11:30:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:33,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:33,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:33,707 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1137264748, now seen corresponding path program 1 times [2019-12-07 11:30:33,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:33,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081139] [2019-12-07 11:30:33,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:33,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081139] [2019-12-07 11:30:33,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:33,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:33,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145117538] [2019-12-07 11:30:33,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:33,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:33,762 INFO L87 Difference]: Start difference. First operand 13933 states and 42483 transitions. Second operand 4 states. [2019-12-07 11:30:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:33,835 INFO L93 Difference]: Finished difference Result 13748 states and 41760 transitions. [2019-12-07 11:30:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:33,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 11:30:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:33,850 INFO L225 Difference]: With dead ends: 13748 [2019-12-07 11:30:33,850 INFO L226 Difference]: Without dead ends: 13748 [2019-12-07 11:30:33,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13748 states. [2019-12-07 11:30:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13748 to 12268. [2019-12-07 11:30:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12268 states. [2019-12-07 11:30:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12268 states to 12268 states and 37184 transitions. [2019-12-07 11:30:34,047 INFO L78 Accepts]: Start accepts. Automaton has 12268 states and 37184 transitions. Word has length 67 [2019-12-07 11:30:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:34,048 INFO L462 AbstractCegarLoop]: Abstraction has 12268 states and 37184 transitions. [2019-12-07 11:30:34,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12268 states and 37184 transitions. [2019-12-07 11:30:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:34,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:34,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:34,058 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-07 11:30:34,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:34,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223461986] [2019-12-07 11:30:34,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:34,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223461986] [2019-12-07 11:30:34,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:34,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:30:34,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054383945] [2019-12-07 11:30:34,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:30:34,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:34,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:30:34,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:30:34,203 INFO L87 Difference]: Start difference. First operand 12268 states and 37184 transitions. Second operand 10 states. [2019-12-07 11:30:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:35,530 INFO L93 Difference]: Finished difference Result 27828 states and 84051 transitions. [2019-12-07 11:30:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 11:30:35,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 11:30:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:35,550 INFO L225 Difference]: With dead ends: 27828 [2019-12-07 11:30:35,550 INFO L226 Difference]: Without dead ends: 20334 [2019-12-07 11:30:35,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:30:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20334 states. [2019-12-07 11:30:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20334 to 14854. [2019-12-07 11:30:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14854 states. [2019-12-07 11:30:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14854 states to 14854 states and 44884 transitions. [2019-12-07 11:30:35,806 INFO L78 Accepts]: Start accepts. Automaton has 14854 states and 44884 transitions. Word has length 67 [2019-12-07 11:30:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:35,806 INFO L462 AbstractCegarLoop]: Abstraction has 14854 states and 44884 transitions. [2019-12-07 11:30:35,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:30:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 14854 states and 44884 transitions. [2019-12-07 11:30:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:35,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:35,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:35,819 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1732898859, now seen corresponding path program 2 times [2019-12-07 11:30:35,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:35,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658786523] [2019-12-07 11:30:35,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:35,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658786523] [2019-12-07 11:30:35,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:35,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:30:35,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540234191] [2019-12-07 11:30:35,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:30:35,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:35,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:30:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:30:35,936 INFO L87 Difference]: Start difference. First operand 14854 states and 44884 transitions. Second operand 10 states. [2019-12-07 11:30:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:37,018 INFO L93 Difference]: Finished difference Result 27318 states and 81390 transitions. [2019-12-07 11:30:37,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:30:37,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 11:30:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:37,039 INFO L225 Difference]: With dead ends: 27318 [2019-12-07 11:30:37,039 INFO L226 Difference]: Without dead ends: 21658 [2019-12-07 11:30:37,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:30:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21658 states. [2019-12-07 11:30:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21658 to 15434. [2019-12-07 11:30:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15434 states. [2019-12-07 11:30:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15434 states to 15434 states and 46445 transitions. [2019-12-07 11:30:37,308 INFO L78 Accepts]: Start accepts. Automaton has 15434 states and 46445 transitions. Word has length 67 [2019-12-07 11:30:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:37,308 INFO L462 AbstractCegarLoop]: Abstraction has 15434 states and 46445 transitions. [2019-12-07 11:30:37,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:30:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15434 states and 46445 transitions. [2019-12-07 11:30:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:37,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:37,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:37,321 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:37,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1111610073, now seen corresponding path program 3 times [2019-12-07 11:30:37,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:37,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216177753] [2019-12-07 11:30:37,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:37,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216177753] [2019-12-07 11:30:37,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:37,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:30:37,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003729726] [2019-12-07 11:30:37,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:30:37,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:37,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:30:37,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:30:37,469 INFO L87 Difference]: Start difference. First operand 15434 states and 46445 transitions. Second operand 11 states. [2019-12-07 11:30:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:40,554 INFO L93 Difference]: Finished difference Result 24089 states and 71937 transitions. [2019-12-07 11:30:40,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:30:40,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 11:30:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:40,575 INFO L225 Difference]: With dead ends: 24089 [2019-12-07 11:30:40,575 INFO L226 Difference]: Without dead ends: 21222 [2019-12-07 11:30:40,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:30:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21222 states. [2019-12-07 11:30:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21222 to 15134. [2019-12-07 11:30:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2019-12-07 11:30:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 45573 transitions. [2019-12-07 11:30:40,857 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 45573 transitions. Word has length 67 [2019-12-07 11:30:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:40,857 INFO L462 AbstractCegarLoop]: Abstraction has 15134 states and 45573 transitions. [2019-12-07 11:30:40,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:30:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 45573 transitions. [2019-12-07 11:30:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:40,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:40,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:40,870 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 4 times [2019-12-07 11:30:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:40,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254218852] [2019-12-07 11:30:40,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:40,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254218852] [2019-12-07 11:30:40,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:40,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:30:40,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305203490] [2019-12-07 11:30:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:30:40,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:30:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:30:40,972 INFO L87 Difference]: Start difference. First operand 15134 states and 45573 transitions. Second operand 11 states. [2019-12-07 11:30:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:41,699 INFO L93 Difference]: Finished difference Result 37741 states and 112549 transitions. [2019-12-07 11:30:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:30:41,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 11:30:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:41,727 INFO L225 Difference]: With dead ends: 37741 [2019-12-07 11:30:41,727 INFO L226 Difference]: Without dead ends: 26203 [2019-12-07 11:30:41,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:30:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26203 states. [2019-12-07 11:30:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26203 to 14764. [2019-12-07 11:30:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14764 states. [2019-12-07 11:30:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14764 states to 14764 states and 44382 transitions. [2019-12-07 11:30:42,021 INFO L78 Accepts]: Start accepts. Automaton has 14764 states and 44382 transitions. Word has length 67 [2019-12-07 11:30:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:42,021 INFO L462 AbstractCegarLoop]: Abstraction has 14764 states and 44382 transitions. [2019-12-07 11:30:42,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:30:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14764 states and 44382 transitions. [2019-12-07 11:30:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:42,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:42,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:42,034 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 5 times [2019-12-07 11:30:42,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:42,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881693666] [2019-12-07 11:30:42,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:42,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881693666] [2019-12-07 11:30:42,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:42,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:30:42,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941168661] [2019-12-07 11:30:42,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:30:42,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:30:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:30:42,296 INFO L87 Difference]: Start difference. First operand 14764 states and 44382 transitions. Second operand 15 states. [2019-12-07 11:30:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:44,307 INFO L93 Difference]: Finished difference Result 16688 states and 49011 transitions. [2019-12-07 11:30:44,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:30:44,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 11:30:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:44,340 INFO L225 Difference]: With dead ends: 16688 [2019-12-07 11:30:44,340 INFO L226 Difference]: Without dead ends: 16447 [2019-12-07 11:30:44,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:30:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16447 states. [2019-12-07 11:30:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16447 to 14974. [2019-12-07 11:30:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14974 states. [2019-12-07 11:30:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14974 states to 14974 states and 44506 transitions. [2019-12-07 11:30:44,575 INFO L78 Accepts]: Start accepts. Automaton has 14974 states and 44506 transitions. Word has length 67 [2019-12-07 11:30:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:44,575 INFO L462 AbstractCegarLoop]: Abstraction has 14974 states and 44506 transitions. [2019-12-07 11:30:44,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:30:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14974 states and 44506 transitions. [2019-12-07 11:30:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:44,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:44,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:44,588 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1110370993, now seen corresponding path program 6 times [2019-12-07 11:30:44,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:44,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280170855] [2019-12-07 11:30:44,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:44,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280170855] [2019-12-07 11:30:44,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:44,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:30:44,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949136071] [2019-12-07 11:30:44,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:30:44,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:44,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:30:44,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:30:44,707 INFO L87 Difference]: Start difference. First operand 14974 states and 44506 transitions. Second operand 11 states. [2019-12-07 11:30:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:45,870 INFO L93 Difference]: Finished difference Result 23073 states and 67889 transitions. [2019-12-07 11:30:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:30:45,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 11:30:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:45,901 INFO L225 Difference]: With dead ends: 23073 [2019-12-07 11:30:45,901 INFO L226 Difference]: Without dead ends: 22790 [2019-12-07 11:30:45,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:30:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22790 states. [2019-12-07 11:30:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22790 to 14802. [2019-12-07 11:30:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14802 states. [2019-12-07 11:30:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14802 states to 14802 states and 44078 transitions. [2019-12-07 11:30:46,161 INFO L78 Accepts]: Start accepts. Automaton has 14802 states and 44078 transitions. Word has length 67 [2019-12-07 11:30:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:46,161 INFO L462 AbstractCegarLoop]: Abstraction has 14802 states and 44078 transitions. [2019-12-07 11:30:46,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:30:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 14802 states and 44078 transitions. [2019-12-07 11:30:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:30:46,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:46,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:46,174 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 7 times [2019-12-07 11:30:46,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:46,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737757701] [2019-12-07 11:30:46,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:30:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:30:46,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:30:46,255 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:30:46,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23| 1)) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t38~0.base_23| 4)) (= v_~__unbuffered_p0_EBX~0_60 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t38~0.base_23|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23|) |v_ULTIMATE.start_main_~#t38~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23|) 0) (= 0 |v_ULTIMATE.start_main_~#t38~0.offset_18|) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_15|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t38~0.offset=|v_ULTIMATE.start_main_~#t38~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_18|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t38~0.base=|v_ULTIMATE.start_main_~#t38~0.base_23|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t40~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t40~0.offset, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t38~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t39~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t38~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 11:30:46,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-2116194988 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-2116194988|) (= |P0Thread1of1ForFork2_#in~arg.base_In-2116194988| P0Thread1of1ForFork2_~arg.base_Out-2116194988) (= 1 ~a$w_buff0_used~0_Out-2116194988) (= P0Thread1of1ForFork2_~arg.offset_Out-2116194988 |P0Thread1of1ForFork2_#in~arg.offset_In-2116194988|) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-2116194988| (ite (not (and (not (= (mod ~a$w_buff0_used~0_Out-2116194988 256) 0)) (not (= (mod ~a$w_buff1_used~0_Out-2116194988 256) 0)))) 1 0)) (= ~a$w_buff1_used~0_Out-2116194988 ~a$w_buff0_used~0_In-2116194988) (= ~a$w_buff0~0_Out-2116194988 1) (= ~a$w_buff0~0_In-2116194988 ~a$w_buff1~0_Out-2116194988) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-2116194988))) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-2116194988|, ~a$w_buff0~0=~a$w_buff0~0_In-2116194988, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2116194988, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-2116194988|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-2116194988, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-2116194988|, ~a$w_buff0~0=~a$w_buff0~0_Out-2116194988, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-2116194988, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-2116194988, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-2116194988, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-2116194988|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-2116194988, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-2116194988, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-2116194988|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:30:46,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13|) |v_ULTIMATE.start_main_~#t39~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t39~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t39~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t39~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t39~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_11|, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t39~0.offset, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:30:46,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1891649171 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1891649171 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out-1891649171| |P1Thread1of1ForFork0_#t~ite9_Out-1891649171|))) (or (and (= |P1Thread1of1ForFork0_#t~ite9_Out-1891649171| ~a~0_In-1891649171) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out-1891649171| ~a$w_buff1~0_In-1891649171) .cse2))) InVars {~a~0=~a~0_In-1891649171, ~a$w_buff1~0=~a$w_buff1~0_In-1891649171, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1891649171, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1891649171} OutVars{~a~0=~a~0_In-1891649171, ~a$w_buff1~0=~a$w_buff1~0_In-1891649171, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1891649171|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1891649171, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1891649171|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1891649171} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 11:30:46,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1287758017 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1287758017 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out-1287758017| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-1287758017| ~a$w_buff0_used~0_In-1287758017) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1287758017, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287758017} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1287758017, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1287758017|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287758017} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 11:30:46,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In713140271 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In713140271 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In713140271 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In713140271 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite12_Out713140271| 0)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out713140271| ~a$w_buff1_used~0_In713140271) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In713140271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In713140271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In713140271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In713140271} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In713140271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In713140271, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out713140271|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In713140271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In713140271} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 11:30:46,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-958926471 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-958926471 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite13_Out-958926471| 0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-958926471 |P1Thread1of1ForFork0_#t~ite13_Out-958926471|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-958926471, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-958926471} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-958926471, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-958926471, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-958926471|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 11:30:46,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1359331578 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1359331578 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1359331578 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In1359331578 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out1359331578| ~a$r_buff1_thd2~0_In1359331578) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out1359331578| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1359331578, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1359331578, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359331578, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1359331578} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1359331578, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1359331578, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359331578, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1359331578|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1359331578} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 11:30:46,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_26|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_25|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:30:46,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12|) |v_ULTIMATE.start_main_~#t40~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t40~0.base_12| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t40~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t40~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t40~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_12|, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t40~0.base, ULTIMATE.start_main_~#t40~0.offset, #length] because there is no mapped edge [2019-12-07 11:30:46,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2053278426 256) 0))) (or (and .cse0 (= ~a$w_buff0~0_In-2053278426 |P2Thread1of1ForFork1_#t~ite20_Out-2053278426|) (= |P2Thread1of1ForFork1_#t~ite21_Out-2053278426| |P2Thread1of1ForFork1_#t~ite20_Out-2053278426|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2053278426 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-2053278426 256)) (and (= 0 (mod ~a$w_buff1_used~0_In-2053278426 256)) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In-2053278426 256) 0) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In-2053278426| |P2Thread1of1ForFork1_#t~ite20_Out-2053278426|) (= ~a$w_buff0~0_In-2053278426 |P2Thread1of1ForFork1_#t~ite21_Out-2053278426|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-2053278426|, ~a$w_buff0~0=~a$w_buff0~0_In-2053278426, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2053278426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2053278426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2053278426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2053278426, ~weak$$choice2~0=~weak$$choice2~0_In-2053278426} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-2053278426|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-2053278426|, ~a$w_buff0~0=~a$w_buff0~0_In-2053278426, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2053278426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2053278426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2053278426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2053278426, ~weak$$choice2~0=~weak$$choice2~0_In-2053278426} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:30:46,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-390685055 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-390685055| |P2Thread1of1ForFork1_#t~ite26_Out-390685055|) (= |P2Thread1of1ForFork1_#t~ite27_Out-390685055| ~a$w_buff0_used~0_In-390685055)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-390685055| |P2Thread1of1ForFork1_#t~ite26_Out-390685055|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-390685055 256)))) (or (= (mod ~a$w_buff0_used~0_In-390685055 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-390685055 256))) (and .cse1 (= (mod ~a$w_buff1_used~0_In-390685055 256) 0)))) (= ~a$w_buff0_used~0_In-390685055 |P2Thread1of1ForFork1_#t~ite26_Out-390685055|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-390685055|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-390685055, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-390685055, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-390685055, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-390685055, ~weak$$choice2~0=~weak$$choice2~0_In-390685055} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-390685055|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-390685055|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-390685055, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-390685055, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-390685055, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-390685055, ~weak$$choice2~0=~weak$$choice2~0_In-390685055} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 11:30:46,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:30:46,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 11:30:46,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-906345905 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-906345905 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-906345905| ~a~0_In-906345905) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In-906345905 |P2Thread1of1ForFork1_#t~ite38_Out-906345905|) (not .cse0)))) InVars {~a~0=~a~0_In-906345905, ~a$w_buff1~0=~a$w_buff1~0_In-906345905, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-906345905, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-906345905} OutVars{~a~0=~a~0_In-906345905, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-906345905|, ~a$w_buff1~0=~a$w_buff1~0_In-906345905, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-906345905, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-906345905} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 11:30:46,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 11:30:46,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2145304452 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2145304452 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-2145304452| 0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-2145304452 |P2Thread1of1ForFork1_#t~ite40_Out-2145304452|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145304452, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145304452} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145304452, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145304452, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-2145304452|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 11:30:46,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1690402259 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1690402259 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1690402259 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1690402259 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out1690402259| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite41_Out1690402259| ~a$w_buff1_used~0_In1690402259) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1690402259, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1690402259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1690402259, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1690402259} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1690402259, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1690402259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1690402259, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1690402259|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1690402259} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 11:30:46,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In945406400 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In945406400 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out945406400|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In945406400 |P2Thread1of1ForFork1_#t~ite42_Out945406400|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In945406400, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In945406400} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out945406400|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In945406400, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In945406400} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 11:30:46,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-933637327 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-933637327 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-933637327 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-933637327 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-933637327 |P2Thread1of1ForFork1_#t~ite43_Out-933637327|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-933637327| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-933637327, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-933637327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-933637327, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-933637327} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-933637327|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-933637327, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-933637327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-933637327, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-933637327} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 11:30:46,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_32|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:30:46,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-126945747 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-126945747 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-126945747|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-126945747 |P0Thread1of1ForFork2_#t~ite5_Out-126945747|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-126945747, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-126945747} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-126945747|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-126945747, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-126945747} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 11:30:46,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In-1335517637 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1335517637 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1335517637 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1335517637 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out-1335517637| ~a$w_buff1_used~0_In-1335517637)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork2_#t~ite6_Out-1335517637| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1335517637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1335517637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1335517637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1335517637} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1335517637, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1335517637|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1335517637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1335517637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1335517637} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 11:30:46,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_Out-62434982 ~a$r_buff0_thd1~0_In-62434982)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-62434982 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-62434982 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out-62434982 0) (not .cse2)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-62434982, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-62434982} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-62434982|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-62434982, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-62434982} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:30:46,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In-1490553662 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1490553662 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1490553662 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1490553662 256) 0))) (or (and (= ~a$r_buff1_thd1~0_In-1490553662 |P0Thread1of1ForFork2_#t~ite8_Out-1490553662|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1490553662|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1490553662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1490553662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1490553662, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1490553662} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1490553662|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1490553662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1490553662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1490553662, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1490553662} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:30:46,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_42| v_~a$r_buff1_thd1~0_72) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 11:30:46,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:30:46,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1927519456 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1927519456 256)))) (or (and (= ~a$w_buff1~0_In-1927519456 |ULTIMATE.start_main_#t~ite47_Out-1927519456|) (not .cse0) (not .cse1)) (and (= ~a~0_In-1927519456 |ULTIMATE.start_main_#t~ite47_Out-1927519456|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1927519456, ~a$w_buff1~0=~a$w_buff1~0_In-1927519456, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1927519456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1927519456} OutVars{~a~0=~a~0_In-1927519456, ~a$w_buff1~0=~a$w_buff1~0_In-1927519456, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1927519456|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1927519456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1927519456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 11:30:46,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 11:30:46,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-313394144 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-313394144 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-313394144| ~a$w_buff0_used~0_In-313394144) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-313394144| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-313394144, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-313394144} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-313394144, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-313394144|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-313394144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 11:30:46,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1872055426 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1872055426 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1872055426 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1872055426 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1872055426|)) (and (= ~a$w_buff1_used~0_In1872055426 |ULTIMATE.start_main_#t~ite50_Out1872055426|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1872055426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1872055426, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1872055426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1872055426} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1872055426|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1872055426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1872055426, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1872055426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1872055426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 11:30:46,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1465572496 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1465572496 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1465572496 |ULTIMATE.start_main_#t~ite51_Out1465572496|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1465572496| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1465572496, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465572496} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1465572496|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1465572496, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465572496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 11:30:46,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-981030965 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-981030965 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-981030965 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-981030965 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-981030965|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In-981030965 |ULTIMATE.start_main_#t~ite52_Out-981030965|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-981030965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-981030965, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-981030965, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-981030965} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-981030965|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-981030965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-981030965, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-981030965, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-981030965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 11:30:46,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:30:46,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:30:46 BasicIcfg [2019-12-07 11:30:46,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:30:46,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:30:46,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:30:46,328 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:30:46,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:28:58" (3/4) ... [2019-12-07 11:30:46,330 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:30:46,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23| 1)) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t38~0.base_23| 4)) (= v_~__unbuffered_p0_EBX~0_60 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t38~0.base_23|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t38~0.base_23|) |v_ULTIMATE.start_main_~#t38~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t38~0.base_23|) 0) (= 0 |v_ULTIMATE.start_main_~#t38~0.offset_18|) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_15|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t38~0.offset=|v_ULTIMATE.start_main_~#t38~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_18|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t38~0.base=|v_ULTIMATE.start_main_~#t38~0.base_23|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t40~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t40~0.offset, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t38~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t39~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t38~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 11:30:46,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-2116194988 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-2116194988|) (= |P0Thread1of1ForFork2_#in~arg.base_In-2116194988| P0Thread1of1ForFork2_~arg.base_Out-2116194988) (= 1 ~a$w_buff0_used~0_Out-2116194988) (= P0Thread1of1ForFork2_~arg.offset_Out-2116194988 |P0Thread1of1ForFork2_#in~arg.offset_In-2116194988|) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-2116194988| (ite (not (and (not (= (mod ~a$w_buff0_used~0_Out-2116194988 256) 0)) (not (= (mod ~a$w_buff1_used~0_Out-2116194988 256) 0)))) 1 0)) (= ~a$w_buff1_used~0_Out-2116194988 ~a$w_buff0_used~0_In-2116194988) (= ~a$w_buff0~0_Out-2116194988 1) (= ~a$w_buff0~0_In-2116194988 ~a$w_buff1~0_Out-2116194988) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-2116194988))) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-2116194988|, ~a$w_buff0~0=~a$w_buff0~0_In-2116194988, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2116194988, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-2116194988|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-2116194988, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-2116194988|, ~a$w_buff0~0=~a$w_buff0~0_Out-2116194988, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-2116194988, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-2116194988, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-2116194988, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-2116194988|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-2116194988, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-2116194988, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-2116194988|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:30:46,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t39~0.base_13|) |v_ULTIMATE.start_main_~#t39~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t39~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t39~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t39~0.base_13|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t39~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t39~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t39~0.offset=|v_ULTIMATE.start_main_~#t39~0.offset_11|, ULTIMATE.start_main_~#t39~0.base=|v_ULTIMATE.start_main_~#t39~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t39~0.offset, ULTIMATE.start_main_~#t39~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:30:46,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1891649171 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1891649171 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out-1891649171| |P1Thread1of1ForFork0_#t~ite9_Out-1891649171|))) (or (and (= |P1Thread1of1ForFork0_#t~ite9_Out-1891649171| ~a~0_In-1891649171) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out-1891649171| ~a$w_buff1~0_In-1891649171) .cse2))) InVars {~a~0=~a~0_In-1891649171, ~a$w_buff1~0=~a$w_buff1~0_In-1891649171, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1891649171, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1891649171} OutVars{~a~0=~a~0_In-1891649171, ~a$w_buff1~0=~a$w_buff1~0_In-1891649171, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1891649171|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1891649171, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1891649171|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1891649171} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 11:30:46,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1287758017 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1287758017 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out-1287758017| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-1287758017| ~a$w_buff0_used~0_In-1287758017) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1287758017, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287758017} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1287758017, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1287758017|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1287758017} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 11:30:46,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In713140271 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In713140271 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In713140271 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In713140271 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite12_Out713140271| 0)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out713140271| ~a$w_buff1_used~0_In713140271) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In713140271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In713140271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In713140271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In713140271} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In713140271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In713140271, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out713140271|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In713140271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In713140271} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 11:30:46,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-958926471 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-958926471 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite13_Out-958926471| 0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-958926471 |P1Thread1of1ForFork0_#t~ite13_Out-958926471|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-958926471, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-958926471} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-958926471, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-958926471, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-958926471|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 11:30:46,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1359331578 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1359331578 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1359331578 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In1359331578 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out1359331578| ~a$r_buff1_thd2~0_In1359331578) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out1359331578| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1359331578, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1359331578, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359331578, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1359331578} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1359331578, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1359331578, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359331578, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1359331578|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1359331578} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 11:30:46,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_26|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_25|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:30:46,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t40~0.base_12|) |v_ULTIMATE.start_main_~#t40~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t40~0.base_12| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t40~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t40~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t40~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t40~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t40~0.base=|v_ULTIMATE.start_main_~#t40~0.base_12|, ULTIMATE.start_main_~#t40~0.offset=|v_ULTIMATE.start_main_~#t40~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t40~0.base, ULTIMATE.start_main_~#t40~0.offset, #length] because there is no mapped edge [2019-12-07 11:30:46,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2053278426 256) 0))) (or (and .cse0 (= ~a$w_buff0~0_In-2053278426 |P2Thread1of1ForFork1_#t~ite20_Out-2053278426|) (= |P2Thread1of1ForFork1_#t~ite21_Out-2053278426| |P2Thread1of1ForFork1_#t~ite20_Out-2053278426|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2053278426 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-2053278426 256)) (and (= 0 (mod ~a$w_buff1_used~0_In-2053278426 256)) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In-2053278426 256) 0) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In-2053278426| |P2Thread1of1ForFork1_#t~ite20_Out-2053278426|) (= ~a$w_buff0~0_In-2053278426 |P2Thread1of1ForFork1_#t~ite21_Out-2053278426|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-2053278426|, ~a$w_buff0~0=~a$w_buff0~0_In-2053278426, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2053278426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2053278426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2053278426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2053278426, ~weak$$choice2~0=~weak$$choice2~0_In-2053278426} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-2053278426|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-2053278426|, ~a$w_buff0~0=~a$w_buff0~0_In-2053278426, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2053278426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2053278426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2053278426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2053278426, ~weak$$choice2~0=~weak$$choice2~0_In-2053278426} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:30:46,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-390685055 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-390685055| |P2Thread1of1ForFork1_#t~ite26_Out-390685055|) (= |P2Thread1of1ForFork1_#t~ite27_Out-390685055| ~a$w_buff0_used~0_In-390685055)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-390685055| |P2Thread1of1ForFork1_#t~ite26_Out-390685055|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-390685055 256)))) (or (= (mod ~a$w_buff0_used~0_In-390685055 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-390685055 256))) (and .cse1 (= (mod ~a$w_buff1_used~0_In-390685055 256) 0)))) (= ~a$w_buff0_used~0_In-390685055 |P2Thread1of1ForFork1_#t~ite26_Out-390685055|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-390685055|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-390685055, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-390685055, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-390685055, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-390685055, ~weak$$choice2~0=~weak$$choice2~0_In-390685055} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-390685055|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-390685055|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-390685055, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-390685055, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-390685055, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-390685055, ~weak$$choice2~0=~weak$$choice2~0_In-390685055} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 11:30:46,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:30:46,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 11:30:46,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-906345905 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-906345905 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-906345905| ~a~0_In-906345905) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In-906345905 |P2Thread1of1ForFork1_#t~ite38_Out-906345905|) (not .cse0)))) InVars {~a~0=~a~0_In-906345905, ~a$w_buff1~0=~a$w_buff1~0_In-906345905, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-906345905, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-906345905} OutVars{~a~0=~a~0_In-906345905, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-906345905|, ~a$w_buff1~0=~a$w_buff1~0_In-906345905, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-906345905, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-906345905} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 11:30:46,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 11:30:46,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2145304452 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2145304452 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-2145304452| 0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-2145304452 |P2Thread1of1ForFork1_#t~ite40_Out-2145304452|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145304452, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145304452} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145304452, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145304452, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-2145304452|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 11:30:46,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1690402259 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1690402259 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1690402259 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1690402259 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite41_Out1690402259| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite41_Out1690402259| ~a$w_buff1_used~0_In1690402259) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1690402259, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1690402259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1690402259, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1690402259} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1690402259, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1690402259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1690402259, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1690402259|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1690402259} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 11:30:46,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In945406400 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In945406400 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out945406400|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In945406400 |P2Thread1of1ForFork1_#t~ite42_Out945406400|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In945406400, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In945406400} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out945406400|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In945406400, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In945406400} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 11:30:46,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-933637327 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-933637327 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-933637327 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-933637327 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-933637327 |P2Thread1of1ForFork1_#t~ite43_Out-933637327|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out-933637327| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-933637327, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-933637327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-933637327, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-933637327} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-933637327|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-933637327, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-933637327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-933637327, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-933637327} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 11:30:46,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_32|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:30:46,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-126945747 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-126945747 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-126945747|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-126945747 |P0Thread1of1ForFork2_#t~ite5_Out-126945747|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-126945747, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-126945747} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-126945747|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-126945747, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-126945747} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 11:30:46,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In-1335517637 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1335517637 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1335517637 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1335517637 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out-1335517637| ~a$w_buff1_used~0_In-1335517637)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork2_#t~ite6_Out-1335517637| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1335517637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1335517637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1335517637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1335517637} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1335517637, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1335517637|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1335517637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1335517637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1335517637} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 11:30:46,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_Out-62434982 ~a$r_buff0_thd1~0_In-62434982)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-62434982 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-62434982 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out-62434982 0) (not .cse2)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-62434982, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-62434982} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-62434982|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-62434982, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-62434982} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:30:46,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In-1490553662 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1490553662 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1490553662 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1490553662 256) 0))) (or (and (= ~a$r_buff1_thd1~0_In-1490553662 |P0Thread1of1ForFork2_#t~ite8_Out-1490553662|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1490553662|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1490553662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1490553662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1490553662, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1490553662} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1490553662|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1490553662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1490553662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1490553662, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1490553662} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:30:46,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_42| v_~a$r_buff1_thd1~0_72) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 11:30:46,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:30:46,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1927519456 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1927519456 256)))) (or (and (= ~a$w_buff1~0_In-1927519456 |ULTIMATE.start_main_#t~ite47_Out-1927519456|) (not .cse0) (not .cse1)) (and (= ~a~0_In-1927519456 |ULTIMATE.start_main_#t~ite47_Out-1927519456|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1927519456, ~a$w_buff1~0=~a$w_buff1~0_In-1927519456, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1927519456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1927519456} OutVars{~a~0=~a~0_In-1927519456, ~a$w_buff1~0=~a$w_buff1~0_In-1927519456, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1927519456|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1927519456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1927519456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 11:30:46,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 11:30:46,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-313394144 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-313394144 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-313394144| ~a$w_buff0_used~0_In-313394144) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-313394144| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-313394144, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-313394144} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-313394144, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-313394144|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-313394144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 11:30:46,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1872055426 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1872055426 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1872055426 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1872055426 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1872055426|)) (and (= ~a$w_buff1_used~0_In1872055426 |ULTIMATE.start_main_#t~ite50_Out1872055426|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1872055426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1872055426, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1872055426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1872055426} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1872055426|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1872055426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1872055426, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1872055426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1872055426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 11:30:46,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1465572496 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1465572496 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1465572496 |ULTIMATE.start_main_#t~ite51_Out1465572496|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1465572496| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1465572496, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465572496} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1465572496|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1465572496, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465572496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 11:30:46,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-981030965 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-981030965 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-981030965 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-981030965 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-981030965|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In-981030965 |ULTIMATE.start_main_#t~ite52_Out-981030965|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-981030965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-981030965, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-981030965, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-981030965} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-981030965|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-981030965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-981030965, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-981030965, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-981030965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 11:30:46,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:30:46,396 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_82b6e716-2742-4959-b9dd-2d700ed99935/bin/uautomizer/witness.graphml [2019-12-07 11:30:46,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:30:46,398 INFO L168 Benchmark]: Toolchain (without parser) took 108925.64 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.4 GB). Free memory was 934.0 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 11:30:46,398 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:30:46,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:46,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:46,399 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:30:46,399 INFO L168 Benchmark]: RCFGBuilder took 432.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:46,399 INFO L168 Benchmark]: TraceAbstraction took 107967.63 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 11:30:46,399 INFO L168 Benchmark]: Witness Printer took 69.27 ms. Allocated memory is still 7.4 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:46,401 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 432.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107967.63 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 69.27 ms. Allocated memory is still 7.4 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.7s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5287 SDtfs, 6008 SDslu, 18222 SDs, 0 SdLazy, 12811 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219155occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 221189 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1023 NumberOfCodeBlocks, 1023 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 304562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...