./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d1dedba2f53a8b300af4003ab021582d8cfaa8de ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:42:37,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:42:37,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:42:37,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:42:37,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:42:37,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:42:37,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:42:37,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:42:37,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:42:37,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:42:37,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:42:37,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:42:37,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:42:37,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:42:37,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:42:37,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:42:37,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:42:37,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:42:37,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:42:37,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:42:37,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:42:37,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:42:37,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:42:37,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:42:37,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:42:37,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:42:37,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:42:37,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:42:37,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:42:37,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:42:37,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:42:37,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:42:37,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:42:37,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:42:37,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:42:37,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:42:37,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:42:37,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:42:37,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:42:37,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:42:37,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:42:37,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:42:37,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:42:37,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:42:37,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:42:37,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:42:37,520 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:42:37,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:42:37,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:42:37,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:42:37,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:42:37,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:42:37,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:42:37,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:42:37,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:42:37,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:42:37,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:42:37,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:42:37,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:42:37,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:42:37,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:42:37,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:42:37,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:42:37,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:42:37,523 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:42:37,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1dedba2f53a8b300af4003ab021582d8cfaa8de [2019-12-07 17:42:37,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:42:37,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:42:37,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:42:37,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:42:37,638 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:42:37,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_pso.oepc.i [2019-12-07 17:42:37,677 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/data/a77222d71/af4d383c5c964288b2f0e9d5a724dce5/FLAG86a82665a [2019-12-07 17:42:38,138 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:42:38,139 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/sv-benchmarks/c/pthread-wmm/podwr000_pso.oepc.i [2019-12-07 17:42:38,149 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/data/a77222d71/af4d383c5c964288b2f0e9d5a724dce5/FLAG86a82665a [2019-12-07 17:42:38,159 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/data/a77222d71/af4d383c5c964288b2f0e9d5a724dce5 [2019-12-07 17:42:38,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:42:38,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:42:38,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:42:38,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:42:38,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:42:38,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38, skipping insertion in model container [2019-12-07 17:42:38,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:42:38,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:42:38,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:42:38,473 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:42:38,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:42:38,558 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:42:38,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38 WrapperNode [2019-12-07 17:42:38,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:42:38,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:42:38,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:42:38,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:42:38,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:42:38,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:42:38,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:42:38,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:42:38,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... [2019-12-07 17:42:38,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:42:38,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:42:38,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:42:38,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:42:38,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:42:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:42:38,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:42:38,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:42:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:42:38,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:42:38,660 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:42:38,987 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:42:38,987 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:42:38,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:42:38 BoogieIcfgContainer [2019-12-07 17:42:38,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:42:38,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:42:38,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:42:38,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:42:38,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:42:38" (1/3) ... [2019-12-07 17:42:38,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7780e1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:42:38, skipping insertion in model container [2019-12-07 17:42:38,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:38" (2/3) ... [2019-12-07 17:42:38,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7780e1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:42:38, skipping insertion in model container [2019-12-07 17:42:38,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:42:38" (3/3) ... [2019-12-07 17:42:38,993 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_pso.oepc.i [2019-12-07 17:42:38,999 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:42:38,999 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:42:39,004 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:42:39,004 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:42:39,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:42:39,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:42:39,066 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:42:39,066 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:42:39,066 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:42:39,066 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:42:39,066 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:42:39,066 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:42:39,066 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:42:39,066 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:42:39,076 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:42:39,077 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:42:39,125 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:42:39,125 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:42:39,133 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 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:42:39,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:42:39,170 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:42:39,170 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:42:39,174 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 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:42:39,184 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:42:39,185 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:42:41,752 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:42:41,858 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 17:42:41,858 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 17:42:41,860 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 17:42:42,182 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 17:42:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 17:42:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:42:42,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:42,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:42:42,188 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 17:42:42,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:42,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104933028] [2019-12-07 17:42:42,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:42,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104933028] [2019-12-07 17:42:42,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:42,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:42:42,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767728729] [2019-12-07 17:42:42,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:42,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:42,342 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 17:42:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:42,533 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 17:42:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:42,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:42:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:42,595 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 17:42:42,595 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 17:42:42,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 17:42:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 17:42:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 17:42:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 17:42:42,873 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 17:42:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:42,874 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 17:42:42,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 17:42:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:42:42,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:42,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:42,877 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 17:42:42,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:42,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383940279] [2019-12-07 17:42:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:42,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383940279] [2019-12-07 17:42:42,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:42,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:42,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556931160] [2019-12-07 17:42:42,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:42,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:42,965 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 17:42:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:43,244 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 17:42:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:43,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:42:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:43,300 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 17:42:43,301 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 17:42:43,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 17:42:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 17:42:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 17:42:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 17:42:43,575 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 17:42:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:43,575 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 17:42:43,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 17:42:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:42:43,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:43,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:43,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 17:42:43,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:43,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846196428] [2019-12-07 17:42:43,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:43,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846196428] [2019-12-07 17:42:43,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:43,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:43,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236196365] [2019-12-07 17:42:43,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:43,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:43,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:43,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:43,636 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 17:42:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:43,845 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 17:42:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:42:43,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:42:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:43,876 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 17:42:43,877 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 17:42:43,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 17:42:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 17:42:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 17:42:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 17:42:44,121 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 17:42:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:44,121 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 17:42:44,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 17:42:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:42:44,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:44,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:44,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 17:42:44,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:44,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786890104] [2019-12-07 17:42:44,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:44,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786890104] [2019-12-07 17:42:44,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:44,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:44,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259418576] [2019-12-07 17:42:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:44,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:44,181 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 17:42:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:44,231 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-07 17:42:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:44,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:42:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:44,250 INFO L225 Difference]: With dead ends: 10750 [2019-12-07 17:42:44,250 INFO L226 Difference]: Without dead ends: 10750 [2019-12-07 17:42:44,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-07 17:42:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-07 17:42:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-07 17:42:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-07 17:42:44,449 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-07 17:42:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:44,449 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-07 17:42:44,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-07 17:42:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:42:44,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:44,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:44,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-07 17:42:44,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:44,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129692080] [2019-12-07 17:42:44,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:44,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 17:42:44,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129692080] [2019-12-07 17:42:44,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:44,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:44,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901461567] [2019-12-07 17:42:44,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:44,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:44,498 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-07 17:42:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:44,518 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-07 17:42:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:44,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:42:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:44,520 INFO L225 Difference]: With dead ends: 2054 [2019-12-07 17:42:44,520 INFO L226 Difference]: Without dead ends: 1457 [2019-12-07 17:42:44,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-07 17:42:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-07 17:42:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-07 17:42:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-07 17:42:44,536 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-07 17:42:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:44,536 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-07 17:42:44,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-07 17:42:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:42:44,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:44,538 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] [2019-12-07 17:42:44,538 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 17:42:44,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:44,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010361317] [2019-12-07 17:42:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:44,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010361317] [2019-12-07 17:42:44,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:44,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:44,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143305611] [2019-12-07 17:42:44,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:42:44,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:44,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:42:44,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:44,612 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-07 17:42:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:44,824 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-07 17:42:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:42:44,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 17:42:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:44,826 INFO L225 Difference]: With dead ends: 2249 [2019-12-07 17:42:44,826 INFO L226 Difference]: Without dead ends: 2197 [2019-12-07 17:42:44,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:42:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-07 17:42:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-07 17:42:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 17:42:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-07 17:42:44,842 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-07 17:42:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:44,842 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-07 17:42:44,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:42:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-07 17:42:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:42:44,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:44,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:44,844 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-07 17:42:44,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:44,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940499160] [2019-12-07 17:42:44,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:44,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940499160] [2019-12-07 17:42:44,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:44,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:44,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538345009] [2019-12-07 17:42:44,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:44,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:44,902 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-07 17:42:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:44,931 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-07 17:42:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:44,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:42:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:44,932 INFO L225 Difference]: With dead ends: 752 [2019-12-07 17:42:44,932 INFO L226 Difference]: Without dead ends: 689 [2019-12-07 17:42:44,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-07 17:42:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-07 17:42:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 17:42:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-07 17:42:44,939 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-07 17:42:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:44,939 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-07 17:42:44,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-07 17:42:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:42:44,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:44,941 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] [2019-12-07 17:42:44,941 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-07 17:42:44,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:44,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341522493] [2019-12-07 17:42:44,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:45,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341522493] [2019-12-07 17:42:45,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:45,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:45,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126373016] [2019-12-07 17:42:45,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:45,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:45,020 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-12-07 17:42:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:45,246 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-12-07 17:42:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:42:45,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 17:42:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:45,247 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 17:42:45,247 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 17:42:45,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 17:42:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-12-07 17:42:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 17:42:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-12-07 17:42:45,258 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-12-07 17:42:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:45,259 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-12-07 17:42:45,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-12-07 17:42:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:42:45,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:45,261 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] [2019-12-07 17:42:45,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:45,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-12-07 17:42:45,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:45,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540699210] [2019-12-07 17:42:45,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:45,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540699210] [2019-12-07 17:42:45,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:45,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:45,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542911453] [2019-12-07 17:42:45,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:45,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:45,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:45,319 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-12-07 17:42:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:45,357 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-12-07 17:42:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:45,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:42:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:45,358 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 17:42:45,358 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 17:42:45,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 17:42:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-12-07 17:42:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 17:42:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-12-07 17:42:45,367 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-12-07 17:42:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:45,367 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-12-07 17:42:45,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-12-07 17:42:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:42:45,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:45,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:45,369 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-12-07 17:42:45,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:45,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597843010] [2019-12-07 17:42:45,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:45,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597843010] [2019-12-07 17:42:45,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:45,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:42:45,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256152466] [2019-12-07 17:42:45,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:42:45,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:42:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:45,441 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 7 states. [2019-12-07 17:42:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:45,619 INFO L93 Difference]: Finished difference Result 2731 states and 5823 transitions. [2019-12-07 17:42:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:42:45,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:42:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:45,620 INFO L225 Difference]: With dead ends: 2731 [2019-12-07 17:42:45,621 INFO L226 Difference]: Without dead ends: 1921 [2019-12-07 17:42:45,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:42:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-12-07 17:42:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1024. [2019-12-07 17:42:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2019-12-07 17:42:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2232 transitions. [2019-12-07 17:42:45,649 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2232 transitions. Word has length 52 [2019-12-07 17:42:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:45,650 INFO L462 AbstractCegarLoop]: Abstraction has 1024 states and 2232 transitions. [2019-12-07 17:42:45,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:42:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2232 transitions. [2019-12-07 17:42:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:42:45,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:45,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:45,653 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:45,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 541363326, now seen corresponding path program 2 times [2019-12-07 17:42:45,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:45,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847253015] [2019-12-07 17:42:45,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:45,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847253015] [2019-12-07 17:42:45,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:45,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:42:45,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466295715] [2019-12-07 17:42:45,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:42:45,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:42:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:42:45,861 INFO L87 Difference]: Start difference. First operand 1024 states and 2232 transitions. Second operand 10 states. [2019-12-07 17:42:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:46,374 INFO L93 Difference]: Finished difference Result 2537 states and 5465 transitions. [2019-12-07 17:42:46,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:42:46,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 17:42:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:46,376 INFO L225 Difference]: With dead ends: 2537 [2019-12-07 17:42:46,376 INFO L226 Difference]: Without dead ends: 1529 [2019-12-07 17:42:46,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:42:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-12-07 17:42:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1262. [2019-12-07 17:42:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-07 17:42:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2755 transitions. [2019-12-07 17:42:46,387 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2755 transitions. Word has length 52 [2019-12-07 17:42:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:46,387 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2755 transitions. [2019-12-07 17:42:46,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:42:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2755 transitions. [2019-12-07 17:42:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:42:46,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:46,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:46,389 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1592609074, now seen corresponding path program 1 times [2019-12-07 17:42:46,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:46,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416606962] [2019-12-07 17:42:46,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:46,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416606962] [2019-12-07 17:42:46,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:46,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:46,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912319322] [2019-12-07 17:42:46,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:46,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:46,415 INFO L87 Difference]: Start difference. First operand 1262 states and 2755 transitions. Second operand 3 states. [2019-12-07 17:42:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:46,443 INFO L93 Difference]: Finished difference Result 1673 states and 3603 transitions. [2019-12-07 17:42:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:46,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:42:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:46,444 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 17:42:46,445 INFO L226 Difference]: Without dead ends: 1673 [2019-12-07 17:42:46,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-07 17:42:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1451. [2019-12-07 17:42:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-12-07 17:42:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 3160 transitions. [2019-12-07 17:42:46,458 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 3160 transitions. Word has length 52 [2019-12-07 17:42:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:46,458 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 3160 transitions. [2019-12-07 17:42:46,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 3160 transitions. [2019-12-07 17:42:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:42:46,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:46,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:46,461 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -394116000, now seen corresponding path program 3 times [2019-12-07 17:42:46,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:46,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018234173] [2019-12-07 17:42:46,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:46,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018234173] [2019-12-07 17:42:46,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:46,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:46,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128053193] [2019-12-07 17:42:46,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:46,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:46,511 INFO L87 Difference]: Start difference. First operand 1451 states and 3160 transitions. Second operand 4 states. [2019-12-07 17:42:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:46,526 INFO L93 Difference]: Finished difference Result 1630 states and 3496 transitions. [2019-12-07 17:42:46,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:46,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 17:42:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:46,527 INFO L225 Difference]: With dead ends: 1630 [2019-12-07 17:42:46,527 INFO L226 Difference]: Without dead ends: 892 [2019-12-07 17:42:46,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-07 17:42:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2019-12-07 17:42:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-12-07 17:42:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1939 transitions. [2019-12-07 17:42:46,536 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1939 transitions. Word has length 52 [2019-12-07 17:42:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:46,536 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1939 transitions. [2019-12-07 17:42:46,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1939 transitions. [2019-12-07 17:42:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:42:46,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:46,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:46,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 4 times [2019-12-07 17:42:46,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:46,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014790774] [2019-12-07 17:42:46,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014790774] [2019-12-07 17:42:46,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:46,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:42:46,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644623701] [2019-12-07 17:42:46,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:42:46,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:46,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:42:46,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:46,594 INFO L87 Difference]: Start difference. First operand 892 states and 1939 transitions. Second operand 7 states. [2019-12-07 17:42:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:46,723 INFO L93 Difference]: Finished difference Result 1536 states and 3229 transitions. [2019-12-07 17:42:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:42:46,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:42:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:46,724 INFO L225 Difference]: With dead ends: 1536 [2019-12-07 17:42:46,724 INFO L226 Difference]: Without dead ends: 1056 [2019-12-07 17:42:46,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:42:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-07 17:42:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 868. [2019-12-07 17:42:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-07 17:42:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1889 transitions. [2019-12-07 17:42:46,732 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1889 transitions. Word has length 52 [2019-12-07 17:42:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:46,732 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1889 transitions. [2019-12-07 17:42:46,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:42:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1889 transitions. [2019-12-07 17:42:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:42:46,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:46,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:46,734 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:46,734 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 5 times [2019-12-07 17:42:46,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:46,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932964854] [2019-12-07 17:42:46,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:42:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:42:46,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:42:46,811 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:42:46,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40|) |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1549~0.base_40|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40|)) (= v_~y~0_133 0) (= |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| 4) |v_#length_17|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_27|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1549~0.offset=|v_ULTIMATE.start_main_~#t1549~0.offset_27|, ULTIMATE.start_main_~#t1549~0.base=|v_ULTIMATE.start_main_~#t1549~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1550~0.offset, ULTIMATE.start_main_~#t1550~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1549~0.offset, ULTIMATE.start_main_~#t1549~0.base, ~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 17:42:46,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1550~0.base_13| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13|) |v_ULTIMATE.start_main_~#t1550~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1550~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1550~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1550~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1550~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:42:46,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-158895307 ~x~0_In-158895307) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-158895307 0)) (= ~y$r_buff0_thd1~0_Out-158895307 1) (= ~y$r_buff1_thd0~0_Out-158895307 ~y$r_buff0_thd0~0_In-158895307) (= ~y$r_buff1_thd2~0_Out-158895307 ~y$r_buff0_thd2~0_In-158895307) (= ~y$r_buff0_thd1~0_In-158895307 ~y$r_buff1_thd1~0_Out-158895307)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158895307, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-158895307, ~x~0=~x~0_In-158895307} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-158895307, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-158895307, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-158895307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158895307, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-158895307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-158895307, ~x~0=~x~0_In-158895307} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:42:46,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In548841639 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In548841639 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out548841639| ~y$w_buff0_used~0_In548841639) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out548841639| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In548841639, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In548841639} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out548841639|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In548841639, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In548841639} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:42:46,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In122907733 256)))) (or (and (= ~y$w_buff0_used~0_In122907733 |P1Thread1of1ForFork1_#t~ite21_Out122907733|) (= |P1Thread1of1ForFork1_#t~ite20_In122907733| |P1Thread1of1ForFork1_#t~ite20_Out122907733|) (not .cse0)) (and (= ~y$w_buff0_used~0_In122907733 |P1Thread1of1ForFork1_#t~ite20_Out122907733|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In122907733 256)))) (or (= (mod ~y$w_buff0_used~0_In122907733 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In122907733 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In122907733 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out122907733| |P1Thread1of1ForFork1_#t~ite20_Out122907733|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In122907733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In122907733, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In122907733|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In122907733, ~weak$$choice2~0=~weak$$choice2~0_In122907733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In122907733} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In122907733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In122907733, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out122907733|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In122907733, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out122907733|, ~weak$$choice2~0=~weak$$choice2~0_In122907733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In122907733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:42:46,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-2124561208| |P1Thread1of1ForFork1_#t~ite23_Out-2124561208|)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2124561208 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2124561208 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In-2124561208 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-2124561208 256) 0)) (.cse3 (= 0 (mod ~weak$$choice2~0_In-2124561208 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (or (not .cse1) .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-2124561208| 0) .cse3 (or (not .cse4) .cse2) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-2124561208| |P1Thread1of1ForFork1_#t~ite22_Out-2124561208|))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-2124561208| |P1Thread1of1ForFork1_#t~ite22_Out-2124561208|) (or (and .cse3 .cse5 (or .cse0 (and .cse1 .cse6) (and .cse4 .cse6)) (= |P1Thread1of1ForFork1_#t~ite23_Out-2124561208| ~y$w_buff1_used~0_In-2124561208)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-2124561208| |P1Thread1of1ForFork1_#t~ite23_In-2124561208|) (not .cse3) (= |P1Thread1of1ForFork1_#t~ite24_Out-2124561208| ~y$w_buff1_used~0_In-2124561208)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2124561208, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2124561208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2124561208, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2124561208|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2124561208|, ~weak$$choice2~0=~weak$$choice2~0_In-2124561208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2124561208} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2124561208, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2124561208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2124561208, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2124561208|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2124561208|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2124561208|, ~weak$$choice2~0=~weak$$choice2~0_In-2124561208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2124561208} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:42:46,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-2120199300 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2120199300 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2120199300 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-2120199300 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-2120199300| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2120199300| ~y$w_buff1_used~0_In-2120199300) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2120199300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120199300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120199300} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2120199300|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2120199300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120199300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120199300} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:42:46,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-962350810 ~y$r_buff0_thd1~0_Out-962350810)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-962350810 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-962350810 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-962350810) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-962350810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-962350810|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-962350810} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:42:46,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In97157024 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In97157024 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In97157024 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In97157024 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out97157024|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In97157024 |P0Thread1of1ForFork0_#t~ite8_Out97157024|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In97157024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In97157024, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In97157024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In97157024} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In97157024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In97157024, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out97157024|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In97157024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In97157024} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:42:46,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:42:46,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In59360642 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out59360642| ~y$r_buff1_thd2~0_In59360642) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In59360642 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In59360642 256) 0)) (= (mod ~y$w_buff0_used~0_In59360642 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In59360642 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out59360642| |P1Thread1of1ForFork1_#t~ite30_Out59360642|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out59360642| ~y$r_buff1_thd2~0_In59360642) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In59360642| |P1Thread1of1ForFork1_#t~ite29_Out59360642|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In59360642|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out59360642|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out59360642|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:42:46,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} 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_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:42:46,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1875636712 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1875636712 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1875636712| ~y$w_buff1~0_In1875636712)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1875636712| ~y~0_In1875636712)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff1~0=~y$w_buff1~0_In1875636712, ~y~0=~y~0_In1875636712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff1~0=~y$w_buff1~0_In1875636712, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1875636712|, ~y~0=~y~0_In1875636712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:42:46,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:42:46,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1072438666 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1072438666 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1072438666|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1072438666| ~y$w_buff0_used~0_In1072438666)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1072438666, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1072438666} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1072438666, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1072438666, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1072438666|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:42:46,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In859970586 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In859970586 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In859970586 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In859970586 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out859970586| ~y$w_buff1_used~0_In859970586) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out859970586| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In859970586, ~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In859970586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In859970586} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In859970586, ~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In859970586, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out859970586|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In859970586} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:42:46,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1034823554 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1034823554 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1034823554| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1034823554| ~y$r_buff0_thd2~0_In-1034823554)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1034823554} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1034823554, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1034823554|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-748835653 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-748835653 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-748835653 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-748835653 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-748835653| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-748835653| ~y$r_buff1_thd2~0_In-748835653) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-748835653|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1721354145 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1721354145 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1721354145| ~y~0_In-1721354145) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1721354145| ~y$w_buff1~0_In-1721354145) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1721354145, ~y~0=~y~0_In-1721354145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721354145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721354145} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1721354145|, ~y$w_buff1~0=~y$w_buff1~0_In-1721354145, ~y~0=~y~0_In-1721354145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721354145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721354145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:42:46,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1550127172 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1550127172 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1550127172| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1550127172| ~y$w_buff0_used~0_In-1550127172)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1550127172|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:42:46,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-639006710 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-639006710 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-639006710 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-639006710 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-639006710|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-639006710 |ULTIMATE.start_main_#t~ite43_Out-639006710|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-639006710|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:42:46,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-440404216 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-440404216 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-440404216 |ULTIMATE.start_main_#t~ite44_Out-440404216|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-440404216|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-440404216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-440404216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-440404216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-440404216, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-440404216|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:42:46,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In854321499 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In854321499 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In854321499 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In854321499 256)))) (or (and (= ~y$r_buff1_thd0~0_In854321499 |ULTIMATE.start_main_#t~ite45_Out854321499|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out854321499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In854321499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In854321499, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In854321499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In854321499} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In854321499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In854321499, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In854321499, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out854321499|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In854321499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:42:46,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:42:46,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:42:46 BasicIcfg [2019-12-07 17:42:46,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:42:46,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:42:46,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:42:46,872 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:42:46,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:42:38" (3/4) ... [2019-12-07 17:42:46,874 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:42:46,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1549~0.base_40|) |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1549~0.base_40|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1549~0.base_40|)) (= v_~y~0_133 0) (= |v_ULTIMATE.start_main_~#t1549~0.offset_27| 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1549~0.base_40| 4) |v_#length_17|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_27|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1549~0.offset=|v_ULTIMATE.start_main_~#t1549~0.offset_27|, ULTIMATE.start_main_~#t1549~0.base=|v_ULTIMATE.start_main_~#t1549~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1550~0.offset, ULTIMATE.start_main_~#t1550~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1549~0.offset, ULTIMATE.start_main_~#t1549~0.base, ~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 17:42:46,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1550~0.base_13| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1550~0.base_13|) |v_ULTIMATE.start_main_~#t1550~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1550~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1550~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1550~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1550~0.offset=|v_ULTIMATE.start_main_~#t1550~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1550~0.base=|v_ULTIMATE.start_main_~#t1550~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1550~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1550~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:42:46,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-158895307 ~x~0_In-158895307) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-158895307 0)) (= ~y$r_buff0_thd1~0_Out-158895307 1) (= ~y$r_buff1_thd0~0_Out-158895307 ~y$r_buff0_thd0~0_In-158895307) (= ~y$r_buff1_thd2~0_Out-158895307 ~y$r_buff0_thd2~0_In-158895307) (= ~y$r_buff0_thd1~0_In-158895307 ~y$r_buff1_thd1~0_Out-158895307)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158895307, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-158895307, ~x~0=~x~0_In-158895307} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-158895307, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-158895307, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-158895307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-158895307, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-158895307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-158895307, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-158895307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-158895307, ~x~0=~x~0_In-158895307} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:42:46,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In548841639 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In548841639 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out548841639| ~y$w_buff0_used~0_In548841639) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out548841639| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In548841639, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In548841639} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out548841639|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In548841639, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In548841639} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:42:46,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In122907733 256)))) (or (and (= ~y$w_buff0_used~0_In122907733 |P1Thread1of1ForFork1_#t~ite21_Out122907733|) (= |P1Thread1of1ForFork1_#t~ite20_In122907733| |P1Thread1of1ForFork1_#t~ite20_Out122907733|) (not .cse0)) (and (= ~y$w_buff0_used~0_In122907733 |P1Thread1of1ForFork1_#t~ite20_Out122907733|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In122907733 256)))) (or (= (mod ~y$w_buff0_used~0_In122907733 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In122907733 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In122907733 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out122907733| |P1Thread1of1ForFork1_#t~ite20_Out122907733|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In122907733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In122907733, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In122907733|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In122907733, ~weak$$choice2~0=~weak$$choice2~0_In122907733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In122907733} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In122907733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In122907733, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out122907733|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In122907733, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out122907733|, ~weak$$choice2~0=~weak$$choice2~0_In122907733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In122907733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:42:46,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-2124561208| |P1Thread1of1ForFork1_#t~ite23_Out-2124561208|)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2124561208 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2124561208 256))) (.cse4 (= (mod ~y$w_buff1_used~0_In-2124561208 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-2124561208 256) 0)) (.cse3 (= 0 (mod ~weak$$choice2~0_In-2124561208 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (or (not .cse1) .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-2124561208| 0) .cse3 (or (not .cse4) .cse2) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-2124561208| |P1Thread1of1ForFork1_#t~ite22_Out-2124561208|))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-2124561208| |P1Thread1of1ForFork1_#t~ite22_Out-2124561208|) (or (and .cse3 .cse5 (or .cse0 (and .cse1 .cse6) (and .cse4 .cse6)) (= |P1Thread1of1ForFork1_#t~ite23_Out-2124561208| ~y$w_buff1_used~0_In-2124561208)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-2124561208| |P1Thread1of1ForFork1_#t~ite23_In-2124561208|) (not .cse3) (= |P1Thread1of1ForFork1_#t~ite24_Out-2124561208| ~y$w_buff1_used~0_In-2124561208)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2124561208, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2124561208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2124561208, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2124561208|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2124561208|, ~weak$$choice2~0=~weak$$choice2~0_In-2124561208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2124561208} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2124561208, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2124561208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2124561208, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2124561208|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2124561208|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2124561208|, ~weak$$choice2~0=~weak$$choice2~0_In-2124561208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2124561208} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:42:46,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-2120199300 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2120199300 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2120199300 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-2120199300 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-2120199300| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2120199300| ~y$w_buff1_used~0_In-2120199300) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2120199300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120199300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120199300} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2120199300|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2120199300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120199300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120199300} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:42:46,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-962350810 ~y$r_buff0_thd1~0_Out-962350810)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-962350810 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-962350810 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-962350810) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-962350810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-962350810|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-962350810} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:42:46,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In97157024 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In97157024 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In97157024 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In97157024 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out97157024|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In97157024 |P0Thread1of1ForFork0_#t~ite8_Out97157024|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In97157024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In97157024, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In97157024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In97157024} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In97157024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In97157024, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out97157024|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In97157024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In97157024} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:42:46,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:42:46,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In59360642 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out59360642| ~y$r_buff1_thd2~0_In59360642) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In59360642 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In59360642 256) 0)) (= (mod ~y$w_buff0_used~0_In59360642 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In59360642 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out59360642| |P1Thread1of1ForFork1_#t~ite30_Out59360642|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out59360642| ~y$r_buff1_thd2~0_In59360642) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In59360642| |P1Thread1of1ForFork1_#t~ite29_Out59360642|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In59360642|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In59360642, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out59360642|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out59360642|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In59360642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In59360642, ~weak$$choice2~0=~weak$$choice2~0_In59360642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In59360642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:42:46,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} 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_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:42:46,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1875636712 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1875636712 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1875636712| ~y$w_buff1~0_In1875636712)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1875636712| ~y~0_In1875636712)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff1~0=~y$w_buff1~0_In1875636712, ~y~0=~y~0_In1875636712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff1~0=~y$w_buff1~0_In1875636712, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1875636712|, ~y~0=~y~0_In1875636712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:42:46,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:42:46,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1072438666 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1072438666 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1072438666|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1072438666| ~y$w_buff0_used~0_In1072438666)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1072438666, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1072438666} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1072438666, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1072438666, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1072438666|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:42:46,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In859970586 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In859970586 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In859970586 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In859970586 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out859970586| ~y$w_buff1_used~0_In859970586) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out859970586| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In859970586, ~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In859970586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In859970586} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In859970586, ~y$w_buff0_used~0=~y$w_buff0_used~0_In859970586, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In859970586, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out859970586|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In859970586} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:42:46,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1034823554 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1034823554 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1034823554| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1034823554| ~y$r_buff0_thd2~0_In-1034823554)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1034823554} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034823554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1034823554, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1034823554|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-748835653 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-748835653 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-748835653 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-748835653 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-748835653| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-748835653| ~y$r_buff1_thd2~0_In-748835653) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-748835653|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1721354145 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1721354145 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1721354145| ~y~0_In-1721354145) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1721354145| ~y$w_buff1~0_In-1721354145) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1721354145, ~y~0=~y~0_In-1721354145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721354145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721354145} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1721354145|, ~y$w_buff1~0=~y$w_buff1~0_In-1721354145, ~y~0=~y~0_In-1721354145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1721354145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1721354145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1550127172 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1550127172 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1550127172| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1550127172| ~y$w_buff0_used~0_In-1550127172)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1550127172|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:42:46,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-639006710 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-639006710 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-639006710 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-639006710 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-639006710|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-639006710 |ULTIMATE.start_main_#t~ite43_Out-639006710|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-639006710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-639006710, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-639006710|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-639006710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639006710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:42:46,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-440404216 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-440404216 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-440404216 |ULTIMATE.start_main_#t~ite44_Out-440404216|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-440404216|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-440404216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-440404216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-440404216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-440404216, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-440404216|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:42:46,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In854321499 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In854321499 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In854321499 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In854321499 256)))) (or (and (= ~y$r_buff1_thd0~0_In854321499 |ULTIMATE.start_main_#t~ite45_Out854321499|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out854321499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In854321499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In854321499, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In854321499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In854321499} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In854321499, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In854321499, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In854321499, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out854321499|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In854321499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:42:46,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:42:46,937 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3991afaf-c9fa-41e1-9d3b-7a3577d4a03e/bin/uautomizer/witness.graphml [2019-12-07 17:42:46,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:42:46,939 INFO L168 Benchmark]: Toolchain (without parser) took 8777.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 934.4 MB in the beginning and 960.8 MB in the end (delta: -26.4 MB). Peak memory consumption was 348.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:46,939 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:46,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:46,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:46,940 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:46,941 INFO L168 Benchmark]: RCFGBuilder took 369.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:46,941 INFO L168 Benchmark]: TraceAbstraction took 7882.90 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 272.6 MB). Free memory was 1.0 GB in the beginning and 985.0 MB in the end (delta: 29.8 MB). Peak memory consumption was 302.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:46,941 INFO L168 Benchmark]: Witness Printer took 65.66 ms. Allocated memory is still 1.4 GB. Free memory was 985.0 MB in the beginning and 960.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:46,944 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 369.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7882.90 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 272.6 MB). Free memory was 1.0 GB in the beginning and 985.0 MB in the end (delta: 29.8 MB). Peak memory consumption was 302.4 MB. Max. memory is 11.5 GB. * Witness Printer took 65.66 ms. Allocated memory is still 1.4 GB. Free memory was 985.0 MB in the beginning and 960.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [L796] FCALL, FORK 0 pthread_create(&t1550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L759] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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) [L759] 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) [L760] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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))=1, x=1, 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] [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 : (!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))=0, x=1, 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] [L761] 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)) [L762] 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)) [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$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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L771] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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: 7.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1804 SDtfs, 2204 SDslu, 3873 SDs, 0 SdLazy, 2012 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 7179 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 76968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...