./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_power.opt.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_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38586063487d970bd2652743d9dfba74921893b7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:01:08,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:01:08,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:01:08,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:01:08,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:01:08,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:01:08,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:01:08,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:01:08,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:01:08,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:01:08,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:01:08,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:01:08,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:01:08,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:01:08,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:01:08,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:01:08,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:01:08,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:01:08,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:01:08,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:01:08,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:01:08,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:01:08,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:01:08,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:01:08,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:01:08,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:01:08,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:01:08,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:01:08,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:01:08,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:01:08,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:01:08,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:01:08,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:01:08,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:01:08,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:01:08,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:01:08,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:01:08,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:01:08,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:01:08,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:01:08,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:01:08,704 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:01:08,714 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:01:08,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:01:08,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:01:08,715 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:01:08,716 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:01:08,716 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:01:08,716 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:01:08,716 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:01:08,716 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:01:08,716 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:01:08,716 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:01:08,717 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:01:08,717 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:01:08,717 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:01:08,717 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:01:08,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:01:08,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:01:08,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:01:08,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:01:08,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:01:08,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:01:08,721 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan 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 -> Taipan 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 -> 38586063487d970bd2652743d9dfba74921893b7 [2019-12-07 15:01:08,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:01:08,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:01:08,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:01:08,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:01:08,830 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:01:08,830 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix022_power.opt.i [2019-12-07 15:01:08,873 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/data/4fb3f870c/16730aa0733246b8abb8787d54c4a427/FLAGff20e4897 [2019-12-07 15:01:09,299 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:01:09,300 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/sv-benchmarks/c/pthread-wmm/mix022_power.opt.i [2019-12-07 15:01:09,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/data/4fb3f870c/16730aa0733246b8abb8787d54c4a427/FLAGff20e4897 [2019-12-07 15:01:09,653 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/data/4fb3f870c/16730aa0733246b8abb8787d54c4a427 [2019-12-07 15:01:09,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:01:09,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:01:09,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:01:09,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:01:09,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:01:09,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:01:09" (1/1) ... [2019-12-07 15:01:09,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4880376f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:09, skipping insertion in model container [2019-12-07 15:01:09,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:01:09" (1/1) ... [2019-12-07 15:01:09,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:01:09,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:01:09,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:01:09,938 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:01:09,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:01:10,025 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:01:10,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10 WrapperNode [2019-12-07 15:01:10,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:01:10,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:01:10,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:01:10,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:01:10,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:01:10,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:01:10,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:01:10,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:01:10,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... [2019-12-07 15:01:10,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:01:10,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:01:10,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:01:10,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:01:10,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/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 15:01:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:01:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:01:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:01:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:01:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:01:10,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:01:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:01:10,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:01:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:01:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:01:10,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:01:10,128 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 15:01:10,471 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:01:10,471 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:01:10,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:01:10 BoogieIcfgContainer [2019-12-07 15:01:10,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:01:10,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:01:10,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:01:10,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:01:10,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:01:09" (1/3) ... [2019-12-07 15:01:10,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224292fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:01:10, skipping insertion in model container [2019-12-07 15:01:10,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:01:10" (2/3) ... [2019-12-07 15:01:10,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224292fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:01:10, skipping insertion in model container [2019-12-07 15:01:10,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:01:10" (3/3) ... [2019-12-07 15:01:10,476 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.opt.i [2019-12-07 15:01:10,483 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:01:10,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:01:10,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:01:10,488 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:01:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:01:10,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 15:01:10,567 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:01:10,567 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:01:10,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:01:10,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:01:10,568 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:01:10,568 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:01:10,568 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:01:10,568 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:01:10,578 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 15:01:10,579 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 15:01:10,632 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 15:01:10,632 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:01:10,643 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 15:01:10,659 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 15:01:10,691 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 15:01:10,691 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:01:10,696 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 15:01:10,710 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 15:01:10,711 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:01:13,621 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 15:01:13,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 15:01:13,703 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 15:01:13,705 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 15:01:14,008 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 15:01:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 15:01:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 15:01:14,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:14,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 15:01:14,014 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 15:01:14,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:14,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489423414] [2019-12-07 15:01:14,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:14,153 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 15:01:14,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489423414] [2019-12-07 15:01:14,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:14,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:01:14,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779754423] [2019-12-07 15:01:14,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:14,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:14,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:14,169 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 15:01:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:14,355 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 15:01:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:14,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 15:01:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:14,426 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 15:01:14,426 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 15:01:14,427 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 15:01:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 15:01:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 15:01:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 15:01:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 15:01:14,701 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 15:01:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:14,702 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 15:01:14,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 15:01:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:01:14,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:14,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:14,705 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 15:01:14,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159814576] [2019-12-07 15:01:14,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:14,766 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 15:01:14,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159814576] [2019-12-07 15:01:14,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:14,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:14,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803734725] [2019-12-07 15:01:14,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:14,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:14,769 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 15:01:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:15,072 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-07 15:01:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:01:15,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:01:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:15,130 INFO L225 Difference]: With dead ends: 12178 [2019-12-07 15:01:15,130 INFO L226 Difference]: Without dead ends: 12171 [2019-12-07 15:01:15,131 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 15:01:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-07 15:01:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-07 15:01:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-07 15:01:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-07 15:01:15,440 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-07 15:01:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:15,440 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-07 15:01:15,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-07 15:01:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:01:15,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:15,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:15,445 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:15,445 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 15:01:15,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:15,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703514545] [2019-12-07 15:01:15,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:15,500 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 15:01:15,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703514545] [2019-12-07 15:01:15,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:15,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:15,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167988420] [2019-12-07 15:01:15,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:15,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:15,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:15,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:15,501 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-07 15:01:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:15,646 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-07 15:01:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:01:15,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:01:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:15,678 INFO L225 Difference]: With dead ends: 13366 [2019-12-07 15:01:15,678 INFO L226 Difference]: Without dead ends: 13366 [2019-12-07 15:01:15,678 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 15:01:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-07 15:01:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-07 15:01:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-07 15:01:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-07 15:01:15,937 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-07 15:01:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:15,938 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-07 15:01:15,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-07 15:01:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:01:15,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:15,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:15,941 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-07 15:01:15,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:15,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088631317] [2019-12-07 15:01:15,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:16,015 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 15:01:16,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088631317] [2019-12-07 15:01:16,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:16,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:01:16,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879169149] [2019-12-07 15:01:16,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:16,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:16,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:16,017 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-07 15:01:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:16,090 INFO L93 Difference]: Finished difference Result 20504 states and 63984 transitions. [2019-12-07 15:01:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:16,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 15:01:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:16,116 INFO L225 Difference]: With dead ends: 20504 [2019-12-07 15:01:16,116 INFO L226 Difference]: Without dead ends: 17860 [2019-12-07 15:01:16,116 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 15:01:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17860 states. [2019-12-07 15:01:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17860 to 17149. [2019-12-07 15:01:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17149 states. [2019-12-07 15:01:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17149 states to 17149 states and 53959 transitions. [2019-12-07 15:01:16,440 INFO L78 Accepts]: Start accepts. Automaton has 17149 states and 53959 transitions. Word has length 16 [2019-12-07 15:01:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:16,440 INFO L462 AbstractCegarLoop]: Abstraction has 17149 states and 53959 transitions. [2019-12-07 15:01:16,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17149 states and 53959 transitions. [2019-12-07 15:01:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:01:16,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:16,446 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 15:01:16,446 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-07 15:01:16,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:16,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477374340] [2019-12-07 15:01:16,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:16,496 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 15:01:16,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477374340] [2019-12-07 15:01:16,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:16,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:16,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849356238] [2019-12-07 15:01:16,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:16,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:16,498 INFO L87 Difference]: Start difference. First operand 17149 states and 53959 transitions. Second operand 3 states. [2019-12-07 15:01:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:16,546 INFO L93 Difference]: Finished difference Result 16232 states and 50190 transitions. [2019-12-07 15:01:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:16,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 15:01:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:16,569 INFO L225 Difference]: With dead ends: 16232 [2019-12-07 15:01:16,569 INFO L226 Difference]: Without dead ends: 16232 [2019-12-07 15:01:16,569 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 15:01:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16232 states. [2019-12-07 15:01:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16232 to 16144. [2019-12-07 15:01:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16144 states. [2019-12-07 15:01:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16144 states to 16144 states and 49942 transitions. [2019-12-07 15:01:16,817 INFO L78 Accepts]: Start accepts. Automaton has 16144 states and 49942 transitions. Word has length 17 [2019-12-07 15:01:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:16,817 INFO L462 AbstractCegarLoop]: Abstraction has 16144 states and 49942 transitions. [2019-12-07 15:01:16,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 16144 states and 49942 transitions. [2019-12-07 15:01:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:01:16,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:16,821 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 15:01:16,821 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -851147492, now seen corresponding path program 1 times [2019-12-07 15:01:16,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:16,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507755807] [2019-12-07 15:01:16,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:16,864 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 15:01:16,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507755807] [2019-12-07 15:01:16,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:16,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:16,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747989440] [2019-12-07 15:01:16,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:16,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:16,865 INFO L87 Difference]: Start difference. First operand 16144 states and 49942 transitions. Second operand 4 states. [2019-12-07 15:01:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:16,888 INFO L93 Difference]: Finished difference Result 2956 states and 7469 transitions. [2019-12-07 15:01:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:01:16,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 15:01:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:16,890 INFO L225 Difference]: With dead ends: 2956 [2019-12-07 15:01:16,890 INFO L226 Difference]: Without dead ends: 2053 [2019-12-07 15:01:16,890 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 15:01:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-07 15:01:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-07 15:01:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-07 15:01:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 4591 transitions. [2019-12-07 15:01:16,909 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 4591 transitions. Word has length 17 [2019-12-07 15:01:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:16,909 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 4591 transitions. [2019-12-07 15:01:16,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 4591 transitions. [2019-12-07 15:01:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:01:16,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:16,911 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 15:01:16,911 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:16,911 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 15:01:16,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:16,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158412304] [2019-12-07 15:01:16,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:16,966 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 15:01:16,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158412304] [2019-12-07 15:01:16,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:16,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:01:16,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553071657] [2019-12-07 15:01:16,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:01:16,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:01:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:01:16,967 INFO L87 Difference]: Start difference. First operand 2053 states and 4591 transitions. Second operand 6 states. [2019-12-07 15:01:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:17,274 INFO L93 Difference]: Finished difference Result 5425 states and 11989 transitions. [2019-12-07 15:01:17,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:01:17,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 15:01:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:17,279 INFO L225 Difference]: With dead ends: 5425 [2019-12-07 15:01:17,279 INFO L226 Difference]: Without dead ends: 5390 [2019-12-07 15:01:17,279 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 15:01:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2019-12-07 15:01:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 2720. [2019-12-07 15:01:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-12-07 15:01:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 6213 transitions. [2019-12-07 15:01:17,314 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 6213 transitions. Word has length 25 [2019-12-07 15:01:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:17,314 INFO L462 AbstractCegarLoop]: Abstraction has 2720 states and 6213 transitions. [2019-12-07 15:01:17,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:01:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 6213 transitions. [2019-12-07 15:01:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:01:17,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:17,316 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 15:01:17,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:17,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 15:01:17,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:17,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698295859] [2019-12-07 15:01:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:17,376 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 15:01:17,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698295859] [2019-12-07 15:01:17,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:17,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:01:17,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288323724] [2019-12-07 15:01:17,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:01:17,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:01:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:01:17,377 INFO L87 Difference]: Start difference. First operand 2720 states and 6213 transitions. Second operand 6 states. [2019-12-07 15:01:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:17,695 INFO L93 Difference]: Finished difference Result 5057 states and 11057 transitions. [2019-12-07 15:01:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:01:17,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 15:01:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:17,699 INFO L225 Difference]: With dead ends: 5057 [2019-12-07 15:01:17,699 INFO L226 Difference]: Without dead ends: 5028 [2019-12-07 15:01:17,699 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 15:01:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2019-12-07 15:01:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 2762. [2019-12-07 15:01:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-12-07 15:01:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6322 transitions. [2019-12-07 15:01:17,738 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6322 transitions. Word has length 26 [2019-12-07 15:01:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:17,738 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 6322 transitions. [2019-12-07 15:01:17,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:01:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6322 transitions. [2019-12-07 15:01:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:01:17,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:17,741 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] [2019-12-07 15:01:17,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-07 15:01:17,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:17,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506812201] [2019-12-07 15:01:17,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:17,802 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 15:01:17,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506812201] [2019-12-07 15:01:17,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:17,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:01:17,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073249725] [2019-12-07 15:01:17,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:01:17,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:17,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:01:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:01:17,804 INFO L87 Difference]: Start difference. First operand 2762 states and 6322 transitions. Second operand 5 states. [2019-12-07 15:01:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:17,832 INFO L93 Difference]: Finished difference Result 1446 states and 3288 transitions. [2019-12-07 15:01:17,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:01:17,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 15:01:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:17,834 INFO L225 Difference]: With dead ends: 1446 [2019-12-07 15:01:17,834 INFO L226 Difference]: Without dead ends: 1289 [2019-12-07 15:01:17,834 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 15:01:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-12-07 15:01:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 829. [2019-12-07 15:01:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 15:01:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1865 transitions. [2019-12-07 15:01:17,845 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1865 transitions. Word has length 28 [2019-12-07 15:01:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:17,845 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1865 transitions. [2019-12-07 15:01:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:01:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1865 transitions. [2019-12-07 15:01:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:01:17,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:17,847 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 15:01:17,847 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash 680455281, now seen corresponding path program 1 times [2019-12-07 15:01:17,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:17,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055359774] [2019-12-07 15:01:17,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:17,918 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 15:01:17,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055359774] [2019-12-07 15:01:17,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:17,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:17,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980032007] [2019-12-07 15:01:17,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:17,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:17,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:17,920 INFO L87 Difference]: Start difference. First operand 829 states and 1865 transitions. Second operand 3 states. [2019-12-07 15:01:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:17,956 INFO L93 Difference]: Finished difference Result 1053 states and 2338 transitions. [2019-12-07 15:01:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:17,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 15:01:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:17,957 INFO L225 Difference]: With dead ends: 1053 [2019-12-07 15:01:17,957 INFO L226 Difference]: Without dead ends: 1053 [2019-12-07 15:01:17,957 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 15:01:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-07 15:01:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 753. [2019-12-07 15:01:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 15:01:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1676 transitions. [2019-12-07 15:01:17,964 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1676 transitions. Word has length 52 [2019-12-07 15:01:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:17,965 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1676 transitions. [2019-12-07 15:01:17,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1676 transitions. [2019-12-07 15:01:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:17,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:17,966 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 15:01:17,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1343423494, now seen corresponding path program 1 times [2019-12-07 15:01:17,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:17,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184807671] [2019-12-07 15:01:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:18,076 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 15:01:18,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184807671] [2019-12-07 15:01:18,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:18,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:01:18,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242892627] [2019-12-07 15:01:18,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:01:18,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:18,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:01:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:01:18,078 INFO L87 Difference]: Start difference. First operand 753 states and 1676 transitions. Second operand 9 states. [2019-12-07 15:01:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:19,290 INFO L93 Difference]: Finished difference Result 6759 states and 14677 transitions. [2019-12-07 15:01:19,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 15:01:19,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 15:01:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:19,294 INFO L225 Difference]: With dead ends: 6759 [2019-12-07 15:01:19,294 INFO L226 Difference]: Without dead ends: 4901 [2019-12-07 15:01:19,295 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 15:01:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-12-07 15:01:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 1029. [2019-12-07 15:01:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-07 15:01:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 2313 transitions. [2019-12-07 15:01:19,317 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 2313 transitions. Word has length 53 [2019-12-07 15:01:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:19,317 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 2313 transitions. [2019-12-07 15:01:19,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:01:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 2313 transitions. [2019-12-07 15:01:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:19,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:19,319 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 15:01:19,319 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1900514557, now seen corresponding path program 1 times [2019-12-07 15:01:19,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:19,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443701433] [2019-12-07 15:01:19,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:19,403 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 15:01:19,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443701433] [2019-12-07 15:01:19,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:19,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:01:19,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466837564] [2019-12-07 15:01:19,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:01:19,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:01:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:01:19,404 INFO L87 Difference]: Start difference. First operand 1029 states and 2313 transitions. Second operand 7 states. [2019-12-07 15:01:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:20,074 INFO L93 Difference]: Finished difference Result 2411 states and 5108 transitions. [2019-12-07 15:01:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 15:01:20,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 15:01:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:20,076 INFO L225 Difference]: With dead ends: 2411 [2019-12-07 15:01:20,076 INFO L226 Difference]: Without dead ends: 2411 [2019-12-07 15:01:20,076 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 15:01:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-12-07 15:01:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1283. [2019-12-07 15:01:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 15:01:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2842 transitions. [2019-12-07 15:01:20,092 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2842 transitions. Word has length 53 [2019-12-07 15:01:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:20,092 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2842 transitions. [2019-12-07 15:01:20,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:01:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2842 transitions. [2019-12-07 15:01:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:20,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:20,094 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 15:01:20,094 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash -75320077, now seen corresponding path program 2 times [2019-12-07 15:01:20,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:20,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402305463] [2019-12-07 15:01:20,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:20,133 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 15:01:20,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402305463] [2019-12-07 15:01:20,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:20,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:20,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810927541] [2019-12-07 15:01:20,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:20,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:20,135 INFO L87 Difference]: Start difference. First operand 1283 states and 2842 transitions. Second operand 4 states. [2019-12-07 15:01:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:20,182 INFO L93 Difference]: Finished difference Result 1272 states and 2806 transitions. [2019-12-07 15:01:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:01:20,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 15:01:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:20,183 INFO L225 Difference]: With dead ends: 1272 [2019-12-07 15:01:20,183 INFO L226 Difference]: Without dead ends: 1272 [2019-12-07 15:01:20,184 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 15:01:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-12-07 15:01:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1178. [2019-12-07 15:01:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2019-12-07 15:01:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2591 transitions. [2019-12-07 15:01:20,194 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 2591 transitions. Word has length 53 [2019-12-07 15:01:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:20,195 INFO L462 AbstractCegarLoop]: Abstraction has 1178 states and 2591 transitions. [2019-12-07 15:01:20,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2591 transitions. [2019-12-07 15:01:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:20,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:20,196 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 15:01:20,196 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash -859426251, now seen corresponding path program 1 times [2019-12-07 15:01:20,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:20,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549944954] [2019-12-07 15:01:20,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:20,218 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 15:01:20,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549944954] [2019-12-07 15:01:20,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:20,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:20,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631235005] [2019-12-07 15:01:20,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:20,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:20,219 INFO L87 Difference]: Start difference. First operand 1178 states and 2591 transitions. Second operand 3 states. [2019-12-07 15:01:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:20,241 INFO L93 Difference]: Finished difference Result 1421 states and 3010 transitions. [2019-12-07 15:01:20,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:20,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 15:01:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:20,243 INFO L225 Difference]: With dead ends: 1421 [2019-12-07 15:01:20,243 INFO L226 Difference]: Without dead ends: 1385 [2019-12-07 15:01:20,243 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 15:01:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-12-07 15:01:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1112. [2019-12-07 15:01:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-12-07 15:01:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2423 transitions. [2019-12-07 15:01:20,253 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 2423 transitions. Word has length 53 [2019-12-07 15:01:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:20,254 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 2423 transitions. [2019-12-07 15:01:20,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2423 transitions. [2019-12-07 15:01:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:20,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:20,255 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 15:01:20,255 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1575444104, now seen corresponding path program 2 times [2019-12-07 15:01:20,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:20,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773777907] [2019-12-07 15:01:20,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:20,373 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 15:01:20,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773777907] [2019-12-07 15:01:20,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:20,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:01:20,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398827585] [2019-12-07 15:01:20,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:01:20,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:20,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:01:20,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:01:20,374 INFO L87 Difference]: Start difference. First operand 1112 states and 2423 transitions. Second operand 9 states. [2019-12-07 15:01:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:21,437 INFO L93 Difference]: Finished difference Result 7101 states and 14735 transitions. [2019-12-07 15:01:21,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 15:01:21,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 15:01:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:21,441 INFO L225 Difference]: With dead ends: 7101 [2019-12-07 15:01:21,441 INFO L226 Difference]: Without dead ends: 4787 [2019-12-07 15:01:21,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1559, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 15:01:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2019-12-07 15:01:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 1145. [2019-12-07 15:01:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-07 15:01:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2486 transitions. [2019-12-07 15:01:21,465 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2486 transitions. Word has length 53 [2019-12-07 15:01:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:21,465 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2486 transitions. [2019-12-07 15:01:21,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:01:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2486 transitions. [2019-12-07 15:01:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:21,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:21,467 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 15:01:21,467 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -487878202, now seen corresponding path program 3 times [2019-12-07 15:01:21,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:21,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018724090] [2019-12-07 15:01:21,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:21,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 15:01:21,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018724090] [2019-12-07 15:01:21,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:21,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:21,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759052474] [2019-12-07 15:01:21,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:21,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:21,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:21,519 INFO L87 Difference]: Start difference. First operand 1145 states and 2486 transitions. Second operand 4 states. [2019-12-07 15:01:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:21,534 INFO L93 Difference]: Finished difference Result 2023 states and 4362 transitions. [2019-12-07 15:01:21,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:01:21,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 15:01:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:21,535 INFO L225 Difference]: With dead ends: 2023 [2019-12-07 15:01:21,535 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 15:01:21,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 15:01:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2019-12-07 15:01:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 15:01:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 2006 transitions. [2019-12-07 15:01:21,546 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 2006 transitions. Word has length 53 [2019-12-07 15:01:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:21,547 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 2006 transitions. [2019-12-07 15:01:21,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 2006 transitions. [2019-12-07 15:01:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:21,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:21,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 15:01:21,549 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 4 times [2019-12-07 15:01:21,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:21,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547632863] [2019-12-07 15:01:21,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:21,620 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 15:01:21,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547632863] [2019-12-07 15:01:21,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:21,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:01:21,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837663220] [2019-12-07 15:01:21,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:01:21,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:01:21,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:01:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:01:21,622 INFO L87 Difference]: Start difference. First operand 947 states and 2006 transitions. Second operand 7 states. [2019-12-07 15:01:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:21,745 INFO L93 Difference]: Finished difference Result 1505 states and 3099 transitions. [2019-12-07 15:01:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:01:21,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 15:01:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:21,746 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 15:01:21,746 INFO L226 Difference]: Without dead ends: 1056 [2019-12-07 15:01:21,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:01:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-07 15:01:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 923. [2019-12-07 15:01:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 15:01:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1956 transitions. [2019-12-07 15:01:21,753 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1956 transitions. Word has length 53 [2019-12-07 15:01:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:21,754 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1956 transitions. [2019-12-07 15:01:21,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:01:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1956 transitions. [2019-12-07 15:01:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:01:21,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:21,755 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 15:01:21,755 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 5 times [2019-12-07 15:01:21,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:01:21,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552288317] [2019-12-07 15:01:21,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:01:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:01:21,831 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:01:21,832 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:01:21,834 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_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t587~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) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t587~0.base_29| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29|) |v_ULTIMATE.start_main_~#t587~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29|) 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) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_29|) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 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, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_14|, #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_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_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, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_20|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_17|, ~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, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__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, #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, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, 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, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__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, #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 15:01:21,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #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_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 15:01:21,835 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 15:01:21,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1714366664 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1714366664 256)))) (or (and (= ~y$w_buff0_used~0_In-1714366664 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1714366664, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1714366664} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1714366664|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1714366664, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1714366664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 15:01:21,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1379247409 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1379247409 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1379247409 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1379247409 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1379247409 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| ~y$w_buff0~0_In1379247409) (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| |P1Thread1of1ForFork1_#t~ite15_Out1379247409|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1379247409| ~y$w_buff0~0_In1379247409) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1379247409| |P1Thread1of1ForFork1_#t~ite14_Out1379247409|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379247409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379247409, ~y$w_buff0~0=~y$w_buff0~0_In1379247409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379247409, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1379247409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379247409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379247409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379247409, ~y$w_buff0~0=~y$w_buff0~0_In1379247409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1379247409|, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1379247409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379247409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 15:01:21,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1248105103 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1248105103| ~y$w_buff1~0_In1248105103) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1248105103| |P1Thread1of1ForFork1_#t~ite17_Out1248105103|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1248105103| ~y$w_buff1~0_In1248105103) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1248105103 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1248105103 256))) (= 0 (mod ~y$w_buff0_used~0_In1248105103 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1248105103 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out1248105103| |P1Thread1of1ForFork1_#t~ite18_Out1248105103|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1248105103, ~y$w_buff1~0=~y$w_buff1~0_In1248105103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248105103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1248105103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248105103} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1248105103, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1248105103|, ~y$w_buff1~0=~y$w_buff1~0_In1248105103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248105103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1248105103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248105103} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 15:01:21,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1696299205 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1696299205 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1696299205 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1696299205 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1696299205 |P0Thread1of1ForFork0_#t~ite6_Out1696299205|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1696299205| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1696299205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1696299205, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1696299205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1696299205} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1696299205|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1696299205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1696299205, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1696299205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1696299205} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 15:01:21,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In343263277 256))) (.cse1 (= ~y$r_buff0_thd1~0_Out343263277 ~y$r_buff0_thd1~0_In343263277)) (.cse2 (= (mod ~y$w_buff0_used~0_In343263277 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd1~0_Out343263277 0)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In343263277, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In343263277} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In343263277, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out343263277|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out343263277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 15:01:21,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In2070422756 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In2070422756 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2070422756 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In2070422756 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2070422756| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out2070422756| ~y$r_buff1_thd1~0_In2070422756) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2070422756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070422756, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2070422756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2070422756} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2070422756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070422756, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2070422756|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2070422756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2070422756} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 15:01:21,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-43351937 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-43351937 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-43351937 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-43351937 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-43351937 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out-43351937| ~y$w_buff0_used~0_In-43351937) (= |P1Thread1of1ForFork1_#t~ite21_Out-43351937| |P1Thread1of1ForFork1_#t~ite20_Out-43351937|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-43351937| ~y$w_buff0_used~0_In-43351937) (= |P1Thread1of1ForFork1_#t~ite20_In-43351937| |P1Thread1of1ForFork1_#t~ite20_Out-43351937|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-43351937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-43351937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-43351937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-43351937, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-43351937} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-43351937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-43351937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-43351937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-43351937, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-43351937|, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-43351937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 15:01:21,839 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 15:01:21,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-969945301 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| ~y$r_buff1_thd2~0_In-969945301) (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-969945301 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-969945301 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In-969945301 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-969945301 256) 0)))) (and (= ~y$r_buff1_thd2~0_In-969945301 |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) (= |P1Thread1of1ForFork1_#t~ite29_In-969945301| |P1Thread1of1ForFork1_#t~ite29_Out-969945301|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-969945301, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-969945301|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969945301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969945301} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-969945301, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-969945301|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-969945301|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969945301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969945301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 15:01:21,840 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 15:01:21,840 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 15:01:21,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In583179783 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In583179783 256) 0))) (or (and (= ~y~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In583179783, ~y$w_buff1~0=~y$w_buff1~0_In583179783, ~y~0=~y~0_In583179783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In583179783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In583179783, ~y$w_buff1~0=~y$w_buff1~0_In583179783, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out583179783|, ~y~0=~y~0_In583179783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In583179783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:01:21,840 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 15:01:21,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2120818471 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2120818471 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2120818471|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2120818471| ~y$w_buff0_used~0_In2120818471)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2120818471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2120818471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2120818471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2120818471, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2120818471|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:01:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1653299599 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1653299599 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1653299599 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1653299599 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1653299599| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-1653299599| ~y$w_buff1_used~0_In-1653299599) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1653299599, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1653299599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1653299599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1653299599} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1653299599, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1653299599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1653299599, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1653299599|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1653299599} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:01:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2107952848 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2107952848 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2107952848| ~y$r_buff0_thd2~0_In-2107952848)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2107952848|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107952848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2107952848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107952848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2107952848, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2107952848|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:01:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-168825926 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-168825926 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-168825926 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-168825926 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| ~y$r_buff1_thd2~0_In-168825926) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-168825926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:01:21,841 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 15:01:21,842 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 15:01:21,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1146498003 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1146498003 256) 0))) (or (and (= ~y$w_buff1~0_In-1146498003 |ULTIMATE.start_main_#t~ite40_Out-1146498003|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1146498003 |ULTIMATE.start_main_#t~ite40_Out-1146498003|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1146498003, ~y~0=~y~0_In-1146498003, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1146498003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1146498003} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1146498003|, ~y$w_buff1~0=~y$w_buff1~0_In-1146498003, ~y~0=~y~0_In-1146498003, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1146498003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1146498003} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 15:01:21,842 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 15:01:21,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1157600186 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1157600186 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| ~y$w_buff0_used~0_In-1157600186)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1157600186, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1157600186} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1157600186, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1157600186, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1157600186|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 15:01:21,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1186283447 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1186283447 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1186283447 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1186283447 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1186283447| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1186283447| ~y$w_buff1_used~0_In1186283447) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1186283447, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1186283447, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1186283447|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:01:21,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In629680203 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In629680203 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In629680203 |ULTIMATE.start_main_#t~ite44_Out629680203|)) (and (= |ULTIMATE.start_main_#t~ite44_Out629680203| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In629680203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In629680203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In629680203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In629680203, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out629680203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:01:21,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In641181355 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In641181355 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In641181355 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In641181355 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In641181355 |ULTIMATE.start_main_#t~ite45_Out641181355|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out641181355| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In641181355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In641181355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641181355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In641181355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In641181355, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out641181355|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641181355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:01:21,843 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 15:01:21,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:01:21 BasicIcfg [2019-12-07 15:01:21,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:01:21,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:01:21,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:01:21,893 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:01:21,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:01:10" (3/4) ... [2019-12-07 15:01:21,895 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:01:21,896 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_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t587~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) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t587~0.base_29| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29|) |v_ULTIMATE.start_main_~#t587~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29|) 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) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_29|) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 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, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_14|, #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_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_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, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_20|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_17|, ~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, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__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, #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, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, 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, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__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, #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 15:01:21,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #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_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 15:01:21,897 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 15:01:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1714366664 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1714366664 256)))) (or (and (= ~y$w_buff0_used~0_In-1714366664 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1714366664|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1714366664, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1714366664} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1714366664|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1714366664, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1714366664} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 15:01:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1379247409 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1379247409 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1379247409 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1379247409 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1379247409 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| ~y$w_buff0~0_In1379247409) (= |P1Thread1of1ForFork1_#t~ite14_Out1379247409| |P1Thread1of1ForFork1_#t~ite15_Out1379247409|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1379247409| ~y$w_buff0~0_In1379247409) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1379247409| |P1Thread1of1ForFork1_#t~ite14_Out1379247409|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379247409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379247409, ~y$w_buff0~0=~y$w_buff0~0_In1379247409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379247409, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1379247409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379247409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1379247409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1379247409, ~y$w_buff0~0=~y$w_buff0~0_In1379247409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1379247409, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1379247409|, ~weak$$choice2~0=~weak$$choice2~0_In1379247409, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1379247409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1379247409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 15:01:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1248105103 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1248105103| ~y$w_buff1~0_In1248105103) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1248105103| |P1Thread1of1ForFork1_#t~ite17_Out1248105103|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1248105103| ~y$w_buff1~0_In1248105103) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1248105103 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1248105103 256))) (= 0 (mod ~y$w_buff0_used~0_In1248105103 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1248105103 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out1248105103| |P1Thread1of1ForFork1_#t~ite18_Out1248105103|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1248105103, ~y$w_buff1~0=~y$w_buff1~0_In1248105103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248105103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1248105103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248105103} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1248105103, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1248105103|, ~y$w_buff1~0=~y$w_buff1~0_In1248105103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248105103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1248105103, ~weak$$choice2~0=~weak$$choice2~0_In1248105103, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1248105103|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248105103} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 15:01:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1696299205 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1696299205 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1696299205 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1696299205 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1696299205 |P0Thread1of1ForFork0_#t~ite6_Out1696299205|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1696299205| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1696299205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1696299205, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1696299205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1696299205} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1696299205|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1696299205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1696299205, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1696299205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1696299205} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 15:01:21,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In343263277 256))) (.cse1 (= ~y$r_buff0_thd1~0_Out343263277 ~y$r_buff0_thd1~0_In343263277)) (.cse2 (= (mod ~y$w_buff0_used~0_In343263277 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd1~0_Out343263277 0)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In343263277, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In343263277} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In343263277, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out343263277|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out343263277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 15:01:21,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In2070422756 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In2070422756 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2070422756 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In2070422756 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2070422756| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out2070422756| ~y$r_buff1_thd1~0_In2070422756) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2070422756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070422756, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2070422756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2070422756} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2070422756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070422756, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2070422756|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2070422756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2070422756} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 15:01:21,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-43351937 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-43351937 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-43351937 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-43351937 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-43351937 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out-43351937| ~y$w_buff0_used~0_In-43351937) (= |P1Thread1of1ForFork1_#t~ite21_Out-43351937| |P1Thread1of1ForFork1_#t~ite20_Out-43351937|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-43351937| ~y$w_buff0_used~0_In-43351937) (= |P1Thread1of1ForFork1_#t~ite20_In-43351937| |P1Thread1of1ForFork1_#t~ite20_Out-43351937|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-43351937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-43351937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-43351937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-43351937, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-43351937} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-43351937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-43351937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-43351937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-43351937, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-43351937|, ~weak$$choice2~0=~weak$$choice2~0_In-43351937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-43351937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 15:01:21,900 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 15:01:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-969945301 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| ~y$r_buff1_thd2~0_In-969945301) (= |P1Thread1of1ForFork1_#t~ite29_Out-969945301| |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-969945301 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-969945301 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In-969945301 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-969945301 256) 0)))) (and (= ~y$r_buff1_thd2~0_In-969945301 |P1Thread1of1ForFork1_#t~ite30_Out-969945301|) (= |P1Thread1of1ForFork1_#t~ite29_In-969945301| |P1Thread1of1ForFork1_#t~ite29_Out-969945301|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-969945301, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-969945301|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969945301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969945301} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-969945301, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-969945301|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-969945301|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969945301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-969945301, ~weak$$choice2~0=~weak$$choice2~0_In-969945301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969945301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 15:01:21,900 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 15:01:21,900 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 15:01:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In583179783 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In583179783 256) 0))) (or (and (= ~y~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In583179783 |P1Thread1of1ForFork1_#t~ite32_Out583179783|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In583179783, ~y$w_buff1~0=~y$w_buff1~0_In583179783, ~y~0=~y~0_In583179783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In583179783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In583179783, ~y$w_buff1~0=~y$w_buff1~0_In583179783, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out583179783|, ~y~0=~y~0_In583179783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In583179783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:01:21,900 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 15:01:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2120818471 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2120818471 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2120818471|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2120818471| ~y$w_buff0_used~0_In2120818471)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2120818471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2120818471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2120818471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2120818471, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2120818471|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:01:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1653299599 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1653299599 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1653299599 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1653299599 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1653299599| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-1653299599| ~y$w_buff1_used~0_In-1653299599) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1653299599, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1653299599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1653299599, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1653299599} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1653299599, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1653299599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1653299599, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1653299599|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1653299599} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:01:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2107952848 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2107952848 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2107952848| ~y$r_buff0_thd2~0_In-2107952848)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2107952848|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107952848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2107952848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2107952848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2107952848, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2107952848|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:01:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-168825926 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-168825926 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-168825926 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-168825926 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-168825926| ~y$r_buff1_thd2~0_In-168825926) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-168825926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:01:21,901 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 15:01:21,902 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 15:01:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1146498003 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1146498003 256) 0))) (or (and (= ~y$w_buff1~0_In-1146498003 |ULTIMATE.start_main_#t~ite40_Out-1146498003|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1146498003 |ULTIMATE.start_main_#t~ite40_Out-1146498003|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1146498003, ~y~0=~y~0_In-1146498003, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1146498003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1146498003} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1146498003|, ~y$w_buff1~0=~y$w_buff1~0_In-1146498003, ~y~0=~y~0_In-1146498003, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1146498003, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1146498003} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 15:01:21,902 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 15:01:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1157600186 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1157600186 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| ~y$w_buff0_used~0_In-1157600186)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1157600186| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1157600186, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1157600186} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1157600186, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1157600186, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1157600186|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 15:01:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1186283447 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1186283447 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1186283447 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1186283447 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1186283447| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1186283447| ~y$w_buff1_used~0_In1186283447) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1186283447, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1186283447, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1186283447|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:01:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In629680203 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In629680203 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In629680203 |ULTIMATE.start_main_#t~ite44_Out629680203|)) (and (= |ULTIMATE.start_main_#t~ite44_Out629680203| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In629680203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In629680203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In629680203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In629680203, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out629680203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:01:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In641181355 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In641181355 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In641181355 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In641181355 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In641181355 |ULTIMATE.start_main_#t~ite45_Out641181355|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out641181355| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In641181355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In641181355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641181355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In641181355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In641181355, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out641181355|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641181355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:01:21,903 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 15:01:21,959 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0d386b12-b343-4b54-accd-80a15ba6305c/bin/utaipan/witness.graphml [2019-12-07 15:01:21,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:01:21,961 INFO L168 Benchmark]: Toolchain (without parser) took 12304.52 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 716.7 MB). Free memory was 939.8 MB in the beginning and 1.2 GB in the end (delta: -232.4 MB). Peak memory consumption was 484.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:21,961 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:01:21,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:21,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.50 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:21,962 INFO L168 Benchmark]: Boogie Preprocessor took 23.98 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 15:01:21,962 INFO L168 Benchmark]: RCFGBuilder took 385.64 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: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:21,963 INFO L168 Benchmark]: TraceAbstraction took 11419.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 580.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -151.0 MB). Peak memory consumption was 429.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:21,963 INFO L168 Benchmark]: Witness Printer took 66.85 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:21,965 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.50 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.98 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.64 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: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11419.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 580.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -151.0 MB). Peak memory consumption was 429.9 MB. Max. memory is 11.5 GB. * Witness Printer took 66.85 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 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(&t587, ((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(&t588, ((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.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2448 SDtfs, 4310 SDslu, 5759 SDs, 0 SdLazy, 3570 SolverSat, 437 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17149occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 18403 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 633 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 563 ConstructedInterpolants, 0 QuantifiedInterpolants, 127665 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...