./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_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_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/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 d2e090f7e83a575d605535d45cb53c24f4de9fdf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:10:44,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:10:44,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:10:44,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:10:44,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:10:44,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:10:44,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:10:44,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:10:44,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:10:44,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:10:44,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:10:44,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:10:44,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:10:44,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:10:44,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:10:44,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:10:44,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:10:44,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:10:44,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:10:44,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:10:44,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:10:44,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:10:44,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:10:44,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:10:44,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:10:44,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:10:44,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:10:44,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:10:44,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:10:44,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:10:44,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:10:44,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:10:44,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:10:44,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:10:44,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:10:44,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:10:44,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:10:44,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:10:44,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:10:44,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:10:44,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:10:44,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:10:44,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:10:44,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:10:44,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:10:44,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:10:44,754 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:10:44,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:10:44,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:10:44,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:10:44,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:10:44,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:10:44,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:10:44,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:10:44,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:10:44,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:10:44,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:10:44,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:10:44,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:10:44,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:10:44,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:10:44,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:10:44,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:10:44,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:44,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:10:44,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:10:44,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:10:44,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:10:44,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:10:44,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:10:44,757 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:10:44,757 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_223b0928-9271-42bf-9c20-d6c96f52f668/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 -> d2e090f7e83a575d605535d45cb53c24f4de9fdf [2019-12-07 17:10:44,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:10:44,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:10:44,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:10:44,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:10:44,866 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:10:44,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i [2019-12-07 17:10:44,902 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/data/3ee42e36e/3c1e8933325446288958071db33556b9/FLAGf39403331 [2019-12-07 17:10:45,336 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:10:45,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i [2019-12-07 17:10:45,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/data/3ee42e36e/3c1e8933325446288958071db33556b9/FLAGf39403331 [2019-12-07 17:10:45,355 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/data/3ee42e36e/3c1e8933325446288958071db33556b9 [2019-12-07 17:10:45,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:10:45,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:10:45,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:45,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:10:45,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:10:45,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45, skipping insertion in model container [2019-12-07 17:10:45,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:10:45,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:45,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:45,656 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:10:45,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:45,740 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:10:45,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45 WrapperNode [2019-12-07 17:10:45,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:45,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:45,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:10:45,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:10:45,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:45,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:10:45,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:10:45,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:10:45,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... [2019-12-07 17:10:45,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:10:45,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:10:45,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:10:45,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:10:45,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/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 17:10:45,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:10:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:10:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:10:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:10:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:10:45,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:10:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:10:45,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:10:45,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:10:45,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:10:45,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:10:45,851 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 17:10:46,190 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:10:46,190 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:10:46,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:46 BoogieIcfgContainer [2019-12-07 17:10:46,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:10:46,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:10:46,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:10:46,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:10:46,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:10:45" (1/3) ... [2019-12-07 17:10:46,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:46, skipping insertion in model container [2019-12-07 17:10:46,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:45" (2/3) ... [2019-12-07 17:10:46,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:46, skipping insertion in model container [2019-12-07 17:10:46,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:46" (3/3) ... [2019-12-07 17:10:46,196 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-07 17:10:46,202 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:10:46,202 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:10:46,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:10:46,208 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:10:46,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:46,266 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:10:46,279 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:10:46,279 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:10:46,279 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:10:46,279 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:10:46,279 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:10:46,279 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:10:46,279 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:10:46,279 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:10:46,291 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:10:46,292 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:10:46,351 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:10:46,351 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:46,360 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:10:46,371 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:10:46,402 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:10:46,403 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:46,407 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:10:46,418 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:10:46,419 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:10:49,217 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:10:49,303 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 17:10:49,303 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 17:10:49,305 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 17:10:49,613 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 17:10:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 17:10:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:10:49,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:49,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:10:49,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 17:10:49,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:49,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104623995] [2019-12-07 17:10:49,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:49,761 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 17:10:49,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104623995] [2019-12-07 17:10:49,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:49,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:49,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608509184] [2019-12-07 17:10:49,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:49,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:49,777 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 17:10:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:49,953 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 17:10:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:49,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:10:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:50,021 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 17:10:50,022 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 17:10:50,022 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 17:10:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 17:10:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 17:10:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 17:10:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 17:10:50,287 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 17:10:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:50,288 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 17:10:50,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 17:10:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:10:50,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:50,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:50,290 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:50,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 17:10:50,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:50,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188780080] [2019-12-07 17:10:50,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:50,348 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 17:10:50,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188780080] [2019-12-07 17:10:50,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:50,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:50,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562238086] [2019-12-07 17:10:50,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:50,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:50,350 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 17:10:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:50,617 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-07 17:10:50,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:50,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:10:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:50,670 INFO L225 Difference]: With dead ends: 12178 [2019-12-07 17:10:50,670 INFO L226 Difference]: Without dead ends: 12171 [2019-12-07 17:10:50,670 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 17:10:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-07 17:10:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-07 17:10:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-07 17:10:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-07 17:10:50,944 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-07 17:10:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:50,944 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-07 17:10:50,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-07 17:10:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:10:50,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:50,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:50,949 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 17:10:50,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:50,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885942067] [2019-12-07 17:10:50,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:50,999 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 17:10:51,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885942067] [2019-12-07 17:10:51,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:51,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:51,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140670421] [2019-12-07 17:10:51,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:51,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:51,001 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-07 17:10:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:51,170 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-07 17:10:51,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:51,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:10:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:51,209 INFO L225 Difference]: With dead ends: 13366 [2019-12-07 17:10:51,210 INFO L226 Difference]: Without dead ends: 13366 [2019-12-07 17:10:51,210 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 17:10:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-07 17:10:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-07 17:10:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-07 17:10:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-07 17:10:51,444 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-07 17:10:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:51,444 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-07 17:10:51,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-07 17:10:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:10:51,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:51,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:51,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:51,448 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-07 17:10:51,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:51,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281950196] [2019-12-07 17:10:51,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:51,518 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 17:10:51,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281950196] [2019-12-07 17:10:51,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:51,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:51,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72292871] [2019-12-07 17:10:51,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:51,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:51,521 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 4 states. [2019-12-07 17:10:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:51,603 INFO L93 Difference]: Finished difference Result 12465 states and 38564 transitions. [2019-12-07 17:10:51,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:51,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:10:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:51,626 INFO L225 Difference]: With dead ends: 12465 [2019-12-07 17:10:51,626 INFO L226 Difference]: Without dead ends: 11793 [2019-12-07 17:10:51,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 17:10:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2019-12-07 17:10:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2019-12-07 17:10:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11793 states. [2019-12-07 17:10:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 37047 transitions. [2019-12-07 17:10:51,823 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 37047 transitions. Word has length 16 [2019-12-07 17:10:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:51,823 INFO L462 AbstractCegarLoop]: Abstraction has 11793 states and 37047 transitions. [2019-12-07 17:10:51,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 37047 transitions. [2019-12-07 17:10:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:10:51,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:51,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:51,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1370321063, now seen corresponding path program 1 times [2019-12-07 17:10:51,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:51,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945281215] [2019-12-07 17:10:51,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:51,862 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 17:10:51,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945281215] [2019-12-07 17:10:51,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:51,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:51,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811019195] [2019-12-07 17:10:51,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:51,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:51,863 INFO L87 Difference]: Start difference. First operand 11793 states and 37047 transitions. Second operand 3 states. [2019-12-07 17:10:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:51,894 INFO L93 Difference]: Finished difference Result 11148 states and 34451 transitions. [2019-12-07 17:10:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:51,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:10:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:51,909 INFO L225 Difference]: With dead ends: 11148 [2019-12-07 17:10:51,909 INFO L226 Difference]: Without dead ends: 11148 [2019-12-07 17:10:51,909 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 17:10:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11148 states. [2019-12-07 17:10:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11148 to 11068. [2019-12-07 17:10:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11068 states. [2019-12-07 17:10:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11068 states to 11068 states and 34219 transitions. [2019-12-07 17:10:52,090 INFO L78 Accepts]: Start accepts. Automaton has 11068 states and 34219 transitions. Word has length 17 [2019-12-07 17:10:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:52,090 INFO L462 AbstractCegarLoop]: Abstraction has 11068 states and 34219 transitions. [2019-12-07 17:10:52,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 11068 states and 34219 transitions. [2019-12-07 17:10:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:10:52,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:52,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:52,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash -625146090, now seen corresponding path program 1 times [2019-12-07 17:10:52,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:52,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835199836] [2019-12-07 17:10:52,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:52,143 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 17:10:52,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835199836] [2019-12-07 17:10:52,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:52,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:52,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866252717] [2019-12-07 17:10:52,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:52,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:52,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:52,145 INFO L87 Difference]: Start difference. First operand 11068 states and 34219 transitions. Second operand 4 states. [2019-12-07 17:10:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:52,197 INFO L93 Difference]: Finished difference Result 2183 states and 5399 transitions. [2019-12-07 17:10:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:52,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:10:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:52,200 INFO L225 Difference]: With dead ends: 2183 [2019-12-07 17:10:52,200 INFO L226 Difference]: Without dead ends: 1552 [2019-12-07 17:10:52,200 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 17:10:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-12-07 17:10:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1516. [2019-12-07 17:10:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-12-07 17:10:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3350 transitions. [2019-12-07 17:10:52,218 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3350 transitions. Word has length 17 [2019-12-07 17:10:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:52,218 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 3350 transitions. [2019-12-07 17:10:52,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3350 transitions. [2019-12-07 17:10:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:10:52,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:52,220 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 17:10:52,220 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 17:10:52,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:52,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042501344] [2019-12-07 17:10:52,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:52,289 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 17:10:52,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042501344] [2019-12-07 17:10:52,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:52,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:52,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675185317] [2019-12-07 17:10:52,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:52,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:52,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:52,291 INFO L87 Difference]: Start difference. First operand 1516 states and 3350 transitions. Second operand 6 states. [2019-12-07 17:10:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:52,612 INFO L93 Difference]: Finished difference Result 4211 states and 9200 transitions. [2019-12-07 17:10:52,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:10:52,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:10:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:52,615 INFO L225 Difference]: With dead ends: 4211 [2019-12-07 17:10:52,615 INFO L226 Difference]: Without dead ends: 4176 [2019-12-07 17:10:52,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:10:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2019-12-07 17:10:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 1850. [2019-12-07 17:10:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-12-07 17:10:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 4163 transitions. [2019-12-07 17:10:52,639 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 4163 transitions. Word has length 25 [2019-12-07 17:10:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:52,639 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 4163 transitions. [2019-12-07 17:10:52,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 4163 transitions. [2019-12-07 17:10:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:10:52,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:52,640 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] [2019-12-07 17:10:52,641 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 17:10:52,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:52,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166107518] [2019-12-07 17:10:52,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:52,689 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 17:10:52,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166107518] [2019-12-07 17:10:52,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:52,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:52,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607149255] [2019-12-07 17:10:52,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:52,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:52,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:52,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:52,690 INFO L87 Difference]: Start difference. First operand 1850 states and 4163 transitions. Second operand 6 states. [2019-12-07 17:10:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:52,977 INFO L93 Difference]: Finished difference Result 3920 states and 8502 transitions. [2019-12-07 17:10:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:10:52,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 17:10:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:52,980 INFO L225 Difference]: With dead ends: 3920 [2019-12-07 17:10:52,980 INFO L226 Difference]: Without dead ends: 3891 [2019-12-07 17:10:52,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:10:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2019-12-07 17:10:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 1829. [2019-12-07 17:10:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-12-07 17:10:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 4135 transitions. [2019-12-07 17:10:53,002 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 4135 transitions. Word has length 26 [2019-12-07 17:10:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:53,002 INFO L462 AbstractCegarLoop]: Abstraction has 1829 states and 4135 transitions. [2019-12-07 17:10:53,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 4135 transitions. [2019-12-07 17:10:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:10:53,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:53,004 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 17:10:53,004 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:53,004 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-12-07 17:10:53,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:53,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741534236] [2019-12-07 17:10:53,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:53,058 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 17:10:53,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741534236] [2019-12-07 17:10:53,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:53,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:53,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230079938] [2019-12-07 17:10:53,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:53,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:53,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:53,060 INFO L87 Difference]: Start difference. First operand 1829 states and 4135 transitions. Second operand 5 states. [2019-12-07 17:10:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:53,090 INFO L93 Difference]: Finished difference Result 955 states and 2143 transitions. [2019-12-07 17:10:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:53,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:10:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:53,091 INFO L225 Difference]: With dead ends: 955 [2019-12-07 17:10:53,091 INFO L226 Difference]: Without dead ends: 874 [2019-12-07 17:10:53,091 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 17:10:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-12-07 17:10:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-12-07 17:10:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-12-07 17:10:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1961 transitions. [2019-12-07 17:10:53,098 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1961 transitions. Word has length 27 [2019-12-07 17:10:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:53,099 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1961 transitions. [2019-12-07 17:10:53,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1961 transitions. [2019-12-07 17:10:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:10:53,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:53,100 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] [2019-12-07 17:10:53,100 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash 680455281, now seen corresponding path program 1 times [2019-12-07 17:10:53,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:53,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681413237] [2019-12-07 17:10:53,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:53,144 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 17:10:53,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681413237] [2019-12-07 17:10:53,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:53,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:53,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438629464] [2019-12-07 17:10:53,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:53,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:53,145 INFO L87 Difference]: Start difference. First operand 874 states and 1961 transitions. Second operand 3 states. [2019-12-07 17:10:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:53,176 INFO L93 Difference]: Finished difference Result 1133 states and 2512 transitions. [2019-12-07 17:10:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:53,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:10:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:53,178 INFO L225 Difference]: With dead ends: 1133 [2019-12-07 17:10:53,178 INFO L226 Difference]: Without dead ends: 1133 [2019-12-07 17:10:53,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 17:10:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-12-07 17:10:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 807. [2019-12-07 17:10:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-07 17:10:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1797 transitions. [2019-12-07 17:10:53,187 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1797 transitions. Word has length 52 [2019-12-07 17:10:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:53,187 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1797 transitions. [2019-12-07 17:10:53,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1797 transitions. [2019-12-07 17:10:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:53,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:53,188 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] [2019-12-07 17:10:53,188 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1343423494, now seen corresponding path program 1 times [2019-12-07 17:10:53,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:53,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905388318] [2019-12-07 17:10:53,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:53,305 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 17:10:53,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905388318] [2019-12-07 17:10:53,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:53,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:10:53,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928562426] [2019-12-07 17:10:53,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:10:53,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:10:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:10:53,306 INFO L87 Difference]: Start difference. First operand 807 states and 1797 transitions. Second operand 9 states. [2019-12-07 17:10:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:54,663 INFO L93 Difference]: Finished difference Result 7444 states and 16132 transitions. [2019-12-07 17:10:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 17:10:54,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 17:10:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:54,667 INFO L225 Difference]: With dead ends: 7444 [2019-12-07 17:10:54,667 INFO L226 Difference]: Without dead ends: 4901 [2019-12-07 17:10:54,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=547, Invalid=1805, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 17:10:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-12-07 17:10:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 1029. [2019-12-07 17:10:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-07 17:10:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 2313 transitions. [2019-12-07 17:10:54,688 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 2313 transitions. Word has length 53 [2019-12-07 17:10:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:54,688 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 2313 transitions. [2019-12-07 17:10:54,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:10:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 2313 transitions. [2019-12-07 17:10:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:54,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:54,690 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] [2019-12-07 17:10:54,690 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:54,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1900514557, now seen corresponding path program 1 times [2019-12-07 17:10:54,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:54,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081000377] [2019-12-07 17:10:54,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:54,765 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 17:10:54,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081000377] [2019-12-07 17:10:54,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:54,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:10:54,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783675171] [2019-12-07 17:10:54,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:10:54,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:10:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:10:54,767 INFO L87 Difference]: Start difference. First operand 1029 states and 2313 transitions. Second operand 7 states. [2019-12-07 17:10:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:55,375 INFO L93 Difference]: Finished difference Result 2411 states and 5108 transitions. [2019-12-07 17:10:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:10:55,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:10:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:55,377 INFO L225 Difference]: With dead ends: 2411 [2019-12-07 17:10:55,377 INFO L226 Difference]: Without dead ends: 2411 [2019-12-07 17:10:55,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:10:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-12-07 17:10:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1283. [2019-12-07 17:10:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 17:10:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2842 transitions. [2019-12-07 17:10:55,399 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2842 transitions. Word has length 53 [2019-12-07 17:10:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:55,399 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2842 transitions. [2019-12-07 17:10:55,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:10:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2842 transitions. [2019-12-07 17:10:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:55,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:55,402 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] [2019-12-07 17:10:55,402 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash -75320077, now seen corresponding path program 2 times [2019-12-07 17:10:55,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:55,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966348630] [2019-12-07 17:10:55,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:55,448 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 17:10:55,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966348630] [2019-12-07 17:10:55,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:55,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:55,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976362693] [2019-12-07 17:10:55,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:55,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:55,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:55,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:55,449 INFO L87 Difference]: Start difference. First operand 1283 states and 2842 transitions. Second operand 4 states. [2019-12-07 17:10:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:55,496 INFO L93 Difference]: Finished difference Result 1272 states and 2806 transitions. [2019-12-07 17:10:55,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:55,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:10:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:55,498 INFO L225 Difference]: With dead ends: 1272 [2019-12-07 17:10:55,498 INFO L226 Difference]: Without dead ends: 1272 [2019-12-07 17:10:55,498 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 17:10:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-12-07 17:10:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1178. [2019-12-07 17:10:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2019-12-07 17:10:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2591 transitions. [2019-12-07 17:10:55,508 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 2591 transitions. Word has length 53 [2019-12-07 17:10:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:55,508 INFO L462 AbstractCegarLoop]: Abstraction has 1178 states and 2591 transitions. [2019-12-07 17:10:55,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2591 transitions. [2019-12-07 17:10:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:55,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:55,510 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] [2019-12-07 17:10:55,510 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -859426251, now seen corresponding path program 1 times [2019-12-07 17:10:55,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:55,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221630871] [2019-12-07 17:10:55,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:55,532 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 17:10:55,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221630871] [2019-12-07 17:10:55,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:55,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:55,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875074018] [2019-12-07 17:10:55,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:55,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:55,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:55,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:55,533 INFO L87 Difference]: Start difference. First operand 1178 states and 2591 transitions. Second operand 3 states. [2019-12-07 17:10:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:55,558 INFO L93 Difference]: Finished difference Result 1421 states and 3010 transitions. [2019-12-07 17:10:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:55,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 17:10:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:55,560 INFO L225 Difference]: With dead ends: 1421 [2019-12-07 17:10:55,560 INFO L226 Difference]: Without dead ends: 1385 [2019-12-07 17:10:55,560 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 17:10:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-12-07 17:10:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1112. [2019-12-07 17:10:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-12-07 17:10:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2423 transitions. [2019-12-07 17:10:55,575 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 2423 transitions. Word has length 53 [2019-12-07 17:10:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:55,575 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 2423 transitions. [2019-12-07 17:10:55,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2423 transitions. [2019-12-07 17:10:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:55,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:55,577 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] [2019-12-07 17:10:55,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1575444104, now seen corresponding path program 2 times [2019-12-07 17:10:55,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:55,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102029979] [2019-12-07 17:10:55,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:55,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 17:10:55,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102029979] [2019-12-07 17:10:55,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:55,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:10:55,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925881344] [2019-12-07 17:10:55,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:10:55,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:10:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:10:55,679 INFO L87 Difference]: Start difference. First operand 1112 states and 2423 transitions. Second operand 9 states. [2019-12-07 17:10:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:57,519 INFO L93 Difference]: Finished difference Result 7101 states and 14735 transitions. [2019-12-07 17:10:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 17:10:57,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 17:10:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:57,523 INFO L225 Difference]: With dead ends: 7101 [2019-12-07 17:10:57,523 INFO L226 Difference]: Without dead ends: 4787 [2019-12-07 17:10:57,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1559, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:10:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2019-12-07 17:10:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 1145. [2019-12-07 17:10:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-07 17:10:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2486 transitions. [2019-12-07 17:10:57,547 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2486 transitions. Word has length 53 [2019-12-07 17:10:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:57,548 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2486 transitions. [2019-12-07 17:10:57,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:10:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2486 transitions. [2019-12-07 17:10:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:57,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:57,549 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] [2019-12-07 17:10:57,550 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash -487878202, now seen corresponding path program 3 times [2019-12-07 17:10:57,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:57,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984324113] [2019-12-07 17:10:57,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:57,590 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 17:10:57,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984324113] [2019-12-07 17:10:57,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:57,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:57,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702516192] [2019-12-07 17:10:57,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:57,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:57,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:57,592 INFO L87 Difference]: Start difference. First operand 1145 states and 2486 transitions. Second operand 3 states. [2019-12-07 17:10:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:57,600 INFO L93 Difference]: Finished difference Result 2023 states and 4362 transitions. [2019-12-07 17:10:57,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:57,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 17:10:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:57,601 INFO L225 Difference]: With dead ends: 2023 [2019-12-07 17:10:57,601 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 17:10:57,601 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 17:10:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 17:10:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2019-12-07 17:10:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 17:10:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 2006 transitions. [2019-12-07 17:10:57,608 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 2006 transitions. Word has length 53 [2019-12-07 17:10:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:57,609 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 2006 transitions. [2019-12-07 17:10:57,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 2006 transitions. [2019-12-07 17:10:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:57,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:57,610 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] [2019-12-07 17:10:57,610 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 4 times [2019-12-07 17:10:57,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:57,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999862162] [2019-12-07 17:10:57,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:57,659 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 17:10:57,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999862162] [2019-12-07 17:10:57,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:57,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:10:57,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368219139] [2019-12-07 17:10:57,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:10:57,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:10:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:10:57,661 INFO L87 Difference]: Start difference. First operand 947 states and 2006 transitions. Second operand 7 states. [2019-12-07 17:10:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:57,754 INFO L93 Difference]: Finished difference Result 1505 states and 3099 transitions. [2019-12-07 17:10:57,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:10:57,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:10:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:57,755 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 17:10:57,755 INFO L226 Difference]: Without dead ends: 1056 [2019-12-07 17:10:57,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:10:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-07 17:10:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 923. [2019-12-07 17:10:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 17:10:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1956 transitions. [2019-12-07 17:10:57,762 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1956 transitions. Word has length 53 [2019-12-07 17:10:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:57,762 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1956 transitions. [2019-12-07 17:10:57,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:10:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1956 transitions. [2019-12-07 17:10:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:10:57,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:57,763 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] [2019-12-07 17:10:57,763 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 5 times [2019-12-07 17:10:57,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:57,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499967007] [2019-12-07 17:10:57,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:10:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:10:57,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:10:57,839 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:10:57,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:10:57,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:10:57,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:10:57,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1616419108 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1616419108 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1616419108| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1616419108 |P0Thread1of1ForFork0_#t~ite5_Out-1616419108|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1616419108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:10:57,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-431906040 256) 0))) (or (and (= ~y$w_buff0~0_In-431906040 |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-431906040 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-431906040 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-431906040 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-431906040 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| ~y$w_buff0~0_In-431906040)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-431906040|, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:10:57,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1011290037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| |P1Thread1of1ForFork1_#t~ite18_Out1011290037|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1011290037 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1011290037 256))) (= 0 (mod ~y$w_buff0_used~0_In1011290037 256))))) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_In1011290037| |P1Thread1of1ForFork1_#t~ite17_Out1011290037|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1011290037|, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:10:57,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In957162409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In957162409 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In957162409 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In957162409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| ~y$w_buff1_used~0_In957162409) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out957162409|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:10:57,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1774748054 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1774748054 ~y$r_buff0_thd1~0_Out-1774748054)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1774748054 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1774748054) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1774748054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1774748054|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1774748054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:10:57,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-667059654 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-667059654 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-667059654 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-667059654 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| ~y$r_buff1_thd1~0_In-667059654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-667059654|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:10:57,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In50821591 256) 0))) (or (and (= ~y$w_buff0_used~0_In50821591 |P1Thread1of1ForFork1_#t~ite21_Out50821591|) (= |P1Thread1of1ForFork1_#t~ite20_In50821591| |P1Thread1of1ForFork1_#t~ite20_Out50821591|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| ~y$w_buff0_used~0_In50821591) (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| |P1Thread1of1ForFork1_#t~ite21_Out50821591|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In50821591 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In50821591 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In50821591 256) 0)) (= (mod ~y$w_buff0_used~0_In50821591 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out50821591|, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:10:57,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:10:57,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46855129 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_In-46855129| |P1Thread1of1ForFork1_#t~ite29_Out-46855129|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-46855129 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-46855129 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-46855129 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-46855129 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| |P1Thread1of1ForFork1_#t~ite30_Out-46855129|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-46855129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:10:57,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:10:57,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:10:57,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1635833187 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1635833187 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1635833187 |P1Thread1of1ForFork1_#t~ite32_Out1635833187|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1635833187| ~y$w_buff1~0_In1635833187) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635833187|, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:10:57,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:10:57,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In666358140 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In666358140 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| ~y$w_buff0_used~0_In666358140) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out666358140|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:10:57,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-706931676 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-706931676 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-706931676 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-706931676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-706931676 |P1Thread1of1ForFork1_#t~ite35_Out-706931676|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-706931676| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-706931676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:10:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-30281257 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-30281257 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-30281257 |P1Thread1of1ForFork1_#t~ite36_Out-30281257|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-30281257| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-30281257|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:10:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-458749234 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-458749234 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-458749234 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-458749234 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-458749234 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458749234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:10:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2067342227 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2067342227 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y$w_buff1~0_In-2067342227) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y~0_In-2067342227) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2067342227|, ~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:10:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:10:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1732599518 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1732599518 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1732599518 |ULTIMATE.start_main_#t~ite42_Out-1732599518|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1732599518|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1732599518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:10:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1730206445 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1730206445 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1730206445 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1730206445 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| ~y$w_buff1_used~0_In-1730206445)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1730206445|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:10:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-18617471 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-18617471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-18617471| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-18617471 |ULTIMATE.start_main_#t~ite44_Out-18617471|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-18617471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:10:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In258948570 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In258948570 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In258948570 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In258948570 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In258948570 |ULTIMATE.start_main_#t~ite45_Out258948570|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out258948570|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out258948570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:10:57,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:10:57,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:10:57 BasicIcfg [2019-12-07 17:10:57,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:10:57,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:10:57,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:10:57,889 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:10:57,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:46" (3/4) ... [2019-12-07 17:10:57,891 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:10:57,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:10:57,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:10:57,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:10:57,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1616419108 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1616419108 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1616419108| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1616419108 |P0Thread1of1ForFork0_#t~ite5_Out-1616419108|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1616419108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:10:57,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-431906040 256) 0))) (or (and (= ~y$w_buff0~0_In-431906040 |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-431906040 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-431906040 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-431906040 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-431906040 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| ~y$w_buff0~0_In-431906040)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-431906040|, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:10:57,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1011290037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| |P1Thread1of1ForFork1_#t~ite18_Out1011290037|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1011290037 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1011290037 256))) (= 0 (mod ~y$w_buff0_used~0_In1011290037 256))))) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_In1011290037| |P1Thread1of1ForFork1_#t~ite17_Out1011290037|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1011290037|, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:10:57,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In957162409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In957162409 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In957162409 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In957162409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| ~y$w_buff1_used~0_In957162409) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out957162409|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:10:57,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1774748054 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1774748054 ~y$r_buff0_thd1~0_Out-1774748054)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1774748054 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1774748054) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1774748054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1774748054|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1774748054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:10:57,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-667059654 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-667059654 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-667059654 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-667059654 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| ~y$r_buff1_thd1~0_In-667059654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-667059654|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:10:57,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In50821591 256) 0))) (or (and (= ~y$w_buff0_used~0_In50821591 |P1Thread1of1ForFork1_#t~ite21_Out50821591|) (= |P1Thread1of1ForFork1_#t~ite20_In50821591| |P1Thread1of1ForFork1_#t~ite20_Out50821591|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| ~y$w_buff0_used~0_In50821591) (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| |P1Thread1of1ForFork1_#t~ite21_Out50821591|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In50821591 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In50821591 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In50821591 256) 0)) (= (mod ~y$w_buff0_used~0_In50821591 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out50821591|, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:10:57,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:10:57,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46855129 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_In-46855129| |P1Thread1of1ForFork1_#t~ite29_Out-46855129|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-46855129 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-46855129 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-46855129 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-46855129 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| |P1Thread1of1ForFork1_#t~ite30_Out-46855129|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-46855129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:10:57,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:10:57,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:10:57,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1635833187 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1635833187 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1635833187 |P1Thread1of1ForFork1_#t~ite32_Out1635833187|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1635833187| ~y$w_buff1~0_In1635833187) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635833187|, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:10:57,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:10:57,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In666358140 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In666358140 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| ~y$w_buff0_used~0_In666358140) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out666358140|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:10:57,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-706931676 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-706931676 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-706931676 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-706931676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-706931676 |P1Thread1of1ForFork1_#t~ite35_Out-706931676|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-706931676| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-706931676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:10:57,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-30281257 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-30281257 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-30281257 |P1Thread1of1ForFork1_#t~ite36_Out-30281257|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-30281257| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-30281257|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-458749234 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-458749234 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-458749234 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-458749234 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-458749234 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458749234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2067342227 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2067342227 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y$w_buff1~0_In-2067342227) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y~0_In-2067342227) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2067342227|, ~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1732599518 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1732599518 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1732599518 |ULTIMATE.start_main_#t~ite42_Out-1732599518|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1732599518|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1732599518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:10:57,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1730206445 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1730206445 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1730206445 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1730206445 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| ~y$w_buff1_used~0_In-1730206445)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1730206445|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:10:57,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-18617471 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-18617471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-18617471| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-18617471 |ULTIMATE.start_main_#t~ite44_Out-18617471|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-18617471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:10:57,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In258948570 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In258948570 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In258948570 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In258948570 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In258948570 |ULTIMATE.start_main_#t~ite45_Out258948570|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out258948570|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out258948570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:10:57,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:10:57,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_223b0928-9271-42bf-9c20-d6c96f52f668/bin/uautomizer/witness.graphml [2019-12-07 17:10:57,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:10:57,948 INFO L168 Benchmark]: Toolchain (without parser) took 12590.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 302.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:57,948 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:57,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:57,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 1.2 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 17:10:57,949 INFO L168 Benchmark]: Boogie Preprocessor took 25.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:57,949 INFO L168 Benchmark]: RCFGBuilder took 385.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:57,949 INFO L168 Benchmark]: TraceAbstraction took 11696.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.6 MB). Peak memory consumption was 257.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:57,950 INFO L168 Benchmark]: Witness Printer took 58.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:57,951 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 1.2 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.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 385.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11696.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.6 MB). Peak memory consumption was 257.4 MB. Max. memory is 11.5 GB. * Witness Printer took 58.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2415 SDtfs, 4463 SDslu, 5867 SDs, 0 SdLazy, 3443 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 16738 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 96362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...