./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 73f223ea09ae1d01ec80d75737e558f25a1a2bd2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:14:48,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:48,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:48,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:48,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:48,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:48,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:48,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:48,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:48,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:48,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:48,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:48,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:48,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:48,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:48,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:48,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:48,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:48,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:48,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:48,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:48,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:48,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:48,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:48,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:48,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:48,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:48,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:48,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:48,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:48,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:48,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:48,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:48,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:48,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:48,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:48,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:48,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:48,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:48,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:48,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:48,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:14:48,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:48,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:48,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:48,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:48,474 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:48,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:48,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:48,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:48,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:48,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:48,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:48,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:48,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:48,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:48,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:48,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:48,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:48,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:48,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:48,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:48,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:48,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:48,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:48,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:48,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:48,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:48,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:48,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:48,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:48,482 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 73f223ea09ae1d01ec80d75737e558f25a1a2bd2 [2019-11-28 18:14:48,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:48,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:48,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:48,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:48,846 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:48,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i [2019-11-28 18:14:48,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d9d2183/7010587ec54b42debc106de1cf79c2fa/FLAGb9272c10c [2019-11-28 18:14:49,500 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:49,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i [2019-11-28 18:14:49,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d9d2183/7010587ec54b42debc106de1cf79c2fa/FLAGb9272c10c [2019-11-28 18:14:49,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7d9d2183/7010587ec54b42debc106de1cf79c2fa [2019-11-28 18:14:49,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:49,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:49,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:49,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:49,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:49,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:49" (1/1) ... [2019-11-28 18:14:49,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315a37d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:49, skipping insertion in model container [2019-11-28 18:14:49,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:49" (1/1) ... [2019-11-28 18:14:49,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:49,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:50,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:50,408 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:50,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:50,569 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:50,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50 WrapperNode [2019-11-28 18:14:50,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:50,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:50,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:50,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:50,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:50,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:50,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:50,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:50,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... [2019-11-28 18:14:50,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:50,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:50,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:50,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:50,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:14:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:50,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:50,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:50,768 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:14:51,483 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:14:51,484 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:14:51,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:51 BoogieIcfgContainer [2019-11-28 18:14:51,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:14:51,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:14:51,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:14:51,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:14:51,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:49" (1/3) ... [2019-11-28 18:14:51,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19789ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:51, skipping insertion in model container [2019-11-28 18:14:51,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:50" (2/3) ... [2019-11-28 18:14:51,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19789ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:51, skipping insertion in model container [2019-11-28 18:14:51,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:51" (3/3) ... [2019-11-28 18:14:51,495 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-11-28 18:14:51,507 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:14:51,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:14:51,516 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:14:51,517 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:14:51,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:51,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:14:51,648 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:14:51,649 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:14:51,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:14:51,649 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:14:51,649 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:14:51,650 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:14:51,650 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:14:51,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:14:51,669 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:14:51,671 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:14:51,756 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:14:51,757 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:51,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:14:51,802 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:14:51,849 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:14:51,850 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:51,861 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:14:51,886 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:14:51,887 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:14:56,255 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:14:56,362 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:14:56,847 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-11-28 18:14:56,847 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-11-28 18:14:56,852 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-11-28 18:14:57,579 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:14:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:14:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:14:57,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:57,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:14:57,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-11-28 18:14:57,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:57,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402431674] [2019-11-28 18:14:57,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:57,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402431674] [2019-11-28 18:14:57,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:57,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:14:57,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519353072] [2019-11-28 18:14:57,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:57,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:57,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:57,994 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:14:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:58,384 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-11-28 18:14:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:58,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:14:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:58,501 INFO L225 Difference]: With dead ends: 8506 [2019-11-28 18:14:58,502 INFO L226 Difference]: Without dead ends: 7522 [2019-11-28 18:14:58,504 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-11-28 18:14:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-11-28 18:14:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-11-28 18:14:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-11-28 18:14:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-11-28 18:14:58,943 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-11-28 18:14:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:58,944 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-11-28 18:14:58,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-11-28 18:14:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:14:58,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:58,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:58,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-11-28 18:14:58,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:58,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731673335] [2019-11-28 18:14:58,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:59,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731673335] [2019-11-28 18:14:59,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:59,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:59,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579299017] [2019-11-28 18:14:59,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:59,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:59,091 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 4 states. [2019-11-28 18:14:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:59,527 INFO L93 Difference]: Finished difference Result 11740 states and 36692 transitions. [2019-11-28 18:14:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:59,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:14:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:59,606 INFO L225 Difference]: With dead ends: 11740 [2019-11-28 18:14:59,606 INFO L226 Difference]: Without dead ends: 11726 [2019-11-28 18:14:59,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2019-11-28 18:15:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 10436. [2019-11-28 18:15:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-11-28 18:15:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 33285 transitions. [2019-11-28 18:15:00,156 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 33285 transitions. Word has length 11 [2019-11-28 18:15:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:00,157 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 33285 transitions. [2019-11-28 18:15:00,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 33285 transitions. [2019-11-28 18:15:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:15:00,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:00,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:00,169 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-11-28 18:15:00,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:00,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920317962] [2019-11-28 18:15:00,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:00,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920317962] [2019-11-28 18:15:00,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:00,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:00,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399624047] [2019-11-28 18:15:00,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:00,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:00,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:00,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:00,254 INFO L87 Difference]: Start difference. First operand 10436 states and 33285 transitions. Second operand 3 states. [2019-11-28 18:15:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:00,404 INFO L93 Difference]: Finished difference Result 15866 states and 49520 transitions. [2019-11-28 18:15:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:00,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:15:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:00,467 INFO L225 Difference]: With dead ends: 15866 [2019-11-28 18:15:00,468 INFO L226 Difference]: Without dead ends: 15866 [2019-11-28 18:15:00,468 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-11-28 18:15:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15866 states. [2019-11-28 18:15:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15866 to 11795. [2019-11-28 18:15:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-11-28 18:15:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 37291 transitions. [2019-11-28 18:15:00,910 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 37291 transitions. Word has length 14 [2019-11-28 18:15:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:00,911 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 37291 transitions. [2019-11-28 18:15:00,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 37291 transitions. [2019-11-28 18:15:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:15:00,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:00,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:00,916 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-11-28 18:15:00,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:00,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74215566] [2019-11-28 18:15:00,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:01,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74215566] [2019-11-28 18:15:01,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:01,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:01,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033965436] [2019-11-28 18:15:01,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:01,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:01,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:01,003 INFO L87 Difference]: Start difference. First operand 11795 states and 37291 transitions. Second operand 4 states. [2019-11-28 18:15:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:01,245 INFO L93 Difference]: Finished difference Result 14131 states and 44142 transitions. [2019-11-28 18:15:01,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:01,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:15:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:01,299 INFO L225 Difference]: With dead ends: 14131 [2019-11-28 18:15:01,300 INFO L226 Difference]: Without dead ends: 14131 [2019-11-28 18:15:01,300 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-11-28 18:15:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14131 states. [2019-11-28 18:15:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14131 to 12855. [2019-11-28 18:15:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12855 states. [2019-11-28 18:15:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 40501 transitions. [2019-11-28 18:15:01,690 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 40501 transitions. Word has length 14 [2019-11-28 18:15:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:01,691 INFO L462 AbstractCegarLoop]: Abstraction has 12855 states and 40501 transitions. [2019-11-28 18:15:01,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 40501 transitions. [2019-11-28 18:15:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:15:01,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:01,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:01,695 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-11-28 18:15:01,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:01,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540058827] [2019-11-28 18:15:01,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:01,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540058827] [2019-11-28 18:15:01,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:01,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:01,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267500916] [2019-11-28 18:15:01,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:01,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:01,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:01,957 INFO L87 Difference]: Start difference. First operand 12855 states and 40501 transitions. Second operand 4 states. [2019-11-28 18:15:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:02,205 INFO L93 Difference]: Finished difference Result 15545 states and 48643 transitions. [2019-11-28 18:15:02,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:02,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:15:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:02,255 INFO L225 Difference]: With dead ends: 15545 [2019-11-28 18:15:02,256 INFO L226 Difference]: Without dead ends: 15545 [2019-11-28 18:15:02,257 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-11-28 18:15:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-11-28 18:15:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 13090. [2019-11-28 18:15:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-11-28 18:15:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41334 transitions. [2019-11-28 18:15:02,660 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41334 transitions. Word has length 14 [2019-11-28 18:15:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:02,661 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41334 transitions. [2019-11-28 18:15:02,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41334 transitions. [2019-11-28 18:15:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:15:02,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:02,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:02,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2143506472, now seen corresponding path program 1 times [2019-11-28 18:15:02,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:02,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194935137] [2019-11-28 18:15:02,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:02,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194935137] [2019-11-28 18:15:02,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:02,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:02,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9107581] [2019-11-28 18:15:02,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:02,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:02,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:02,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:02,742 INFO L87 Difference]: Start difference. First operand 13090 states and 41334 transitions. Second operand 3 states. [2019-11-28 18:15:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:02,812 INFO L93 Difference]: Finished difference Result 13090 states and 40732 transitions. [2019-11-28 18:15:02,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:02,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:15:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:02,839 INFO L225 Difference]: With dead ends: 13090 [2019-11-28 18:15:02,839 INFO L226 Difference]: Without dead ends: 13090 [2019-11-28 18:15:02,840 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-11-28 18:15:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2019-11-28 18:15:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13010. [2019-11-28 18:15:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13010 states. [2019-11-28 18:15:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13010 states to 13010 states and 40500 transitions. [2019-11-28 18:15:03,195 INFO L78 Accepts]: Start accepts. Automaton has 13010 states and 40500 transitions. Word has length 16 [2019-11-28 18:15:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:03,196 INFO L462 AbstractCegarLoop]: Abstraction has 13010 states and 40500 transitions. [2019-11-28 18:15:03,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 13010 states and 40500 transitions. [2019-11-28 18:15:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:15:03,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:03,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:03,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:03,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash 241272403, now seen corresponding path program 1 times [2019-11-28 18:15:03,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:03,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348151027] [2019-11-28 18:15:03,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:03,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348151027] [2019-11-28 18:15:03,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:03,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:15:03,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615871807] [2019-11-28 18:15:03,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:03,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:03,268 INFO L87 Difference]: Start difference. First operand 13010 states and 40500 transitions. Second operand 3 states. [2019-11-28 18:15:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:03,357 INFO L93 Difference]: Finished difference Result 22298 states and 68842 transitions. [2019-11-28 18:15:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:03,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:15:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:03,387 INFO L225 Difference]: With dead ends: 22298 [2019-11-28 18:15:03,388 INFO L226 Difference]: Without dead ends: 19870 [2019-11-28 18:15:03,388 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-11-28 18:15:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19870 states. [2019-11-28 18:15:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19870 to 18980. [2019-11-28 18:15:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-11-28 18:15:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 59240 transitions. [2019-11-28 18:15:04,254 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 59240 transitions. Word has length 16 [2019-11-28 18:15:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:04,254 INFO L462 AbstractCegarLoop]: Abstraction has 18980 states and 59240 transitions. [2019-11-28 18:15:04,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 59240 transitions. [2019-11-28 18:15:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:15:04,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:04,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:04,263 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash -920380529, now seen corresponding path program 1 times [2019-11-28 18:15:04,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:04,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418716412] [2019-11-28 18:15:04,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:04,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418716412] [2019-11-28 18:15:04,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:04,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:04,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162005672] [2019-11-28 18:15:04,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:04,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:04,362 INFO L87 Difference]: Start difference. First operand 18980 states and 59240 transitions. Second operand 3 states. [2019-11-28 18:15:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:04,378 INFO L93 Difference]: Finished difference Result 2388 states and 5347 transitions. [2019-11-28 18:15:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:04,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:15:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:04,382 INFO L225 Difference]: With dead ends: 2388 [2019-11-28 18:15:04,382 INFO L226 Difference]: Without dead ends: 2388 [2019-11-28 18:15:04,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-11-28 18:15:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2019-11-28 18:15:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-11-28 18:15:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5347 transitions. [2019-11-28 18:15:04,425 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5347 transitions. Word has length 17 [2019-11-28 18:15:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:04,425 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5347 transitions. [2019-11-28 18:15:04,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5347 transitions. [2019-11-28 18:15:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:15:04,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:04,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:04,431 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-11-28 18:15:04,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:04,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001631925] [2019-11-28 18:15:04,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:04,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001631925] [2019-11-28 18:15:04,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:04,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:04,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772245146] [2019-11-28 18:15:04,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:04,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:04,557 INFO L87 Difference]: Start difference. First operand 2388 states and 5347 transitions. Second operand 5 states. [2019-11-28 18:15:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:04,799 INFO L93 Difference]: Finished difference Result 2913 states and 6370 transitions. [2019-11-28 18:15:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:15:04,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 18:15:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:04,804 INFO L225 Difference]: With dead ends: 2913 [2019-11-28 18:15:04,804 INFO L226 Difference]: Without dead ends: 2913 [2019-11-28 18:15:04,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-11-28 18:15:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2438. [2019-11-28 18:15:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-11-28 18:15:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 5449 transitions. [2019-11-28 18:15:04,851 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 5449 transitions. Word has length 25 [2019-11-28 18:15:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:04,852 INFO L462 AbstractCegarLoop]: Abstraction has 2438 states and 5449 transitions. [2019-11-28 18:15:04,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 5449 transitions. [2019-11-28 18:15:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:15:04,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:04,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:04,856 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-11-28 18:15:04,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:04,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803941107] [2019-11-28 18:15:04,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:04,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803941107] [2019-11-28 18:15:04,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:04,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:04,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229355321] [2019-11-28 18:15:04,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:04,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:04,904 INFO L87 Difference]: Start difference. First operand 2438 states and 5449 transitions. Second operand 3 states. [2019-11-28 18:15:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:04,944 INFO L93 Difference]: Finished difference Result 3081 states and 6522 transitions. [2019-11-28 18:15:04,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:04,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 18:15:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:04,950 INFO L225 Difference]: With dead ends: 3081 [2019-11-28 18:15:04,950 INFO L226 Difference]: Without dead ends: 3081 [2019-11-28 18:15:04,951 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-11-28 18:15:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2019-11-28 18:15:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2429. [2019-11-28 18:15:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-11-28 18:15:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 5197 transitions. [2019-11-28 18:15:04,994 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 5197 transitions. Word has length 25 [2019-11-28 18:15:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:04,997 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 5197 transitions. [2019-11-28 18:15:04,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 5197 transitions. [2019-11-28 18:15:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:15:05,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:05,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:05,002 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-11-28 18:15:05,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:05,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725731790] [2019-11-28 18:15:05,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:05,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725731790] [2019-11-28 18:15:05,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:05,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:15:05,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094777424] [2019-11-28 18:15:05,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:05,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:05,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:05,140 INFO L87 Difference]: Start difference. First operand 2429 states and 5197 transitions. Second operand 5 states. [2019-11-28 18:15:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:05,200 INFO L93 Difference]: Finished difference Result 2549 states and 5430 transitions. [2019-11-28 18:15:05,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:05,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:15:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:05,204 INFO L225 Difference]: With dead ends: 2549 [2019-11-28 18:15:05,204 INFO L226 Difference]: Without dead ends: 2549 [2019-11-28 18:15:05,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-11-28 18:15:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2019-11-28 18:15:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2019-11-28 18:15:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 5430 transitions. [2019-11-28 18:15:05,245 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 5430 transitions. Word has length 26 [2019-11-28 18:15:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:05,246 INFO L462 AbstractCegarLoop]: Abstraction has 2549 states and 5430 transitions. [2019-11-28 18:15:05,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 5430 transitions. [2019-11-28 18:15:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:15:05,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:05,251 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-11-28 18:15:05,252 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1627795246, now seen corresponding path program 1 times [2019-11-28 18:15:05,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:05,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721227824] [2019-11-28 18:15:05,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:05,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721227824] [2019-11-28 18:15:05,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:05,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:05,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423580800] [2019-11-28 18:15:05,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:05,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:05,376 INFO L87 Difference]: Start difference. First operand 2549 states and 5430 transitions. Second operand 5 states. [2019-11-28 18:15:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:05,595 INFO L93 Difference]: Finished difference Result 2917 states and 6120 transitions. [2019-11-28 18:15:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:15:05,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:15:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:05,598 INFO L225 Difference]: With dead ends: 2917 [2019-11-28 18:15:05,599 INFO L226 Difference]: Without dead ends: 2917 [2019-11-28 18:15:05,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-11-28 18:15:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2513. [2019-11-28 18:15:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-11-28 18:15:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 5358 transitions. [2019-11-28 18:15:05,632 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 5358 transitions. Word has length 27 [2019-11-28 18:15:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:05,632 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 5358 transitions. [2019-11-28 18:15:05,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 5358 transitions. [2019-11-28 18:15:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:15:05,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:05,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:05,636 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-11-28 18:15:05,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:05,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727248210] [2019-11-28 18:15:05,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:05,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727248210] [2019-11-28 18:15:05,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:05,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:05,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099326025] [2019-11-28 18:15:05,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:05,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:05,683 INFO L87 Difference]: Start difference. First operand 2513 states and 5358 transitions. Second operand 4 states. [2019-11-28 18:15:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:05,701 INFO L93 Difference]: Finished difference Result 1235 states and 2606 transitions. [2019-11-28 18:15:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:15:05,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:15:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:05,703 INFO L225 Difference]: With dead ends: 1235 [2019-11-28 18:15:05,703 INFO L226 Difference]: Without dead ends: 1200 [2019-11-28 18:15:05,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-11-28 18:15:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 848. [2019-11-28 18:15:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-11-28 18:15:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1766 transitions. [2019-11-28 18:15:05,716 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1766 transitions. Word has length 28 [2019-11-28 18:15:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:05,716 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1766 transitions. [2019-11-28 18:15:05,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1766 transitions. [2019-11-28 18:15:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:05,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:05,719 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-11-28 18:15:05,719 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1145830791, now seen corresponding path program 1 times [2019-11-28 18:15:05,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:05,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584662612] [2019-11-28 18:15:05,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:05,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584662612] [2019-11-28 18:15:05,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:05,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:15:05,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793095742] [2019-11-28 18:15:05,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:15:05,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:15:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:15:05,817 INFO L87 Difference]: Start difference. First operand 848 states and 1766 transitions. Second operand 6 states. [2019-11-28 18:15:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:06,393 INFO L93 Difference]: Finished difference Result 1428 states and 2900 transitions. [2019-11-28 18:15:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:15:06,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:15:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:06,396 INFO L225 Difference]: With dead ends: 1428 [2019-11-28 18:15:06,397 INFO L226 Difference]: Without dead ends: 1428 [2019-11-28 18:15:06,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:15:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-28 18:15:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1120. [2019-11-28 18:15:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-11-28 18:15:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2323 transitions. [2019-11-28 18:15:06,416 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2323 transitions. Word has length 52 [2019-11-28 18:15:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:06,417 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 2323 transitions. [2019-11-28 18:15:06,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:15:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2323 transitions. [2019-11-28 18:15:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:06,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:06,420 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-11-28 18:15:06,420 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash -234851773, now seen corresponding path program 2 times [2019-11-28 18:15:06,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:06,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80978485] [2019-11-28 18:15:06,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:06,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80978485] [2019-11-28 18:15:06,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:06,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:15:06,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061604896] [2019-11-28 18:15:06,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:15:06,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:15:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:06,525 INFO L87 Difference]: Start difference. First operand 1120 states and 2323 transitions. Second operand 7 states. [2019-11-28 18:15:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:06,809 INFO L93 Difference]: Finished difference Result 3123 states and 6316 transitions. [2019-11-28 18:15:06,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:15:06,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:15:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:06,813 INFO L225 Difference]: With dead ends: 3123 [2019-11-28 18:15:06,813 INFO L226 Difference]: Without dead ends: 2079 [2019-11-28 18:15:06,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:15:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-28 18:15:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1181. [2019-11-28 18:15:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-11-28 18:15:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2424 transitions. [2019-11-28 18:15:06,837 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2424 transitions. Word has length 52 [2019-11-28 18:15:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:06,838 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 2424 transitions. [2019-11-28 18:15:06,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:15:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2424 transitions. [2019-11-28 18:15:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:06,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:06,841 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-11-28 18:15:06,842 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 3 times [2019-11-28 18:15:06,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:06,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403523805] [2019-11-28 18:15:06,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:06,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403523805] [2019-11-28 18:15:06,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:06,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:06,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501200580] [2019-11-28 18:15:06,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:06,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:06,963 INFO L87 Difference]: Start difference. First operand 1181 states and 2424 transitions. Second operand 4 states. [2019-11-28 18:15:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:07,026 INFO L93 Difference]: Finished difference Result 1319 states and 2698 transitions. [2019-11-28 18:15:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:07,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:15:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:07,029 INFO L225 Difference]: With dead ends: 1319 [2019-11-28 18:15:07,029 INFO L226 Difference]: Without dead ends: 1319 [2019-11-28 18:15:07,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-28 18:15:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1040. [2019-11-28 18:15:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-28 18:15:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2152 transitions. [2019-11-28 18:15:07,047 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2152 transitions. Word has length 52 [2019-11-28 18:15:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:07,048 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 2152 transitions. [2019-11-28 18:15:07,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2152 transitions. [2019-11-28 18:15:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:15:07,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:07,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:07,051 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:07,052 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-11-28 18:15:07,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:07,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898484076] [2019-11-28 18:15:07,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:07,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:15:07,206 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:15:07,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27|) |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27| 1)) (= v_~z$w_buff0~0_252 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1093~0.base_27|) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1093~0.base_27| 4)) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= v_~z$w_buff1_used~0_306 0) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_27|, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:07,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff0_thd1~0_In611635474 ~z$r_buff1_thd1~0_Out611635474) (= ~z$r_buff1_thd0~0_Out611635474 ~z$r_buff0_thd0~0_In611635474) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In611635474)) (= ~z$r_buff1_thd2~0_Out611635474 ~z$r_buff0_thd2~0_In611635474) (= ~z$r_buff0_thd1~0_Out611635474 1) (= 1 ~x~0_Out611635474)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In611635474, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In611635474, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In611635474, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out611635474, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out611635474, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out611635474, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In611635474, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out611635474, ~x~0=~x~0_Out611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:07,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-11-28 18:15:07,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2059197966 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2059197966 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2059197966| ~z$w_buff0_used~0_In-2059197966)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2059197966| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2059197966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2059197966} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2059197966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2059197966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2059197966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:07,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1099530092 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1099530092 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1099530092 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1099530092 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1099530092|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1099530092| ~z$w_buff1_used~0_In-1099530092)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1099530092, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1099530092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1099530092, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1099530092} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1099530092|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1099530092, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1099530092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1099530092, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1099530092} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:07,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In773364772 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In773364772 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In773364772 ~z$r_buff0_thd1~0_Out773364772))) (or (and (= 0 ~z$r_buff0_thd1~0_Out773364772) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In773364772, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In773364772} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In773364772, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out773364772|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out773364772} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:15:07,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2106975105 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2106975105 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In2106975105 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2106975105 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2106975105| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In2106975105 |P0Thread1of1ForFork0_#t~ite8_Out2106975105|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2106975105, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2106975105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106975105, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2106975105} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2106975105, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2106975105|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2106975105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106975105, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2106975105} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:07,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:15:07,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:15:07,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1517616419 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1517616419 256)))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In1517616419 256) 0)) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1517616419 256))) (= (mod ~z$w_buff0_used~0_In1517616419 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out1517616419| ~z$r_buff1_thd2~0_In1517616419) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out1517616419| |P1Thread1of1ForFork1_#t~ite30_Out1517616419|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out1517616419| ~z$r_buff1_thd2~0_In1517616419) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1517616419| |P1Thread1of1ForFork1_#t~ite29_Out1517616419|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1517616419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1517616419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517616419, ~weak$$choice2~0=~weak$$choice2~0_In1517616419, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1517616419} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1517616419|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1517616419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1517616419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517616419, ~weak$$choice2~0=~weak$$choice2~0_In1517616419, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1517616419} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:15:07,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:15:07,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In217558017 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In217558017 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In217558017 |P1Thread1of1ForFork1_#t~ite32_Out217558017|)) (and (= ~z~0_In217558017 |P1Thread1of1ForFork1_#t~ite32_Out217558017|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In217558017, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217558017, ~z$w_buff1~0=~z$w_buff1~0_In217558017, ~z~0=~z~0_In217558017} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In217558017, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217558017, ~z$w_buff1~0=~z$w_buff1~0_In217558017, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out217558017|, ~z~0=~z~0_In217558017} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:15:07,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |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|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-11-28 18:15:07,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1198338823 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1198338823 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1198338823| ~z$w_buff0_used~0_In-1198338823)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1198338823| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198338823, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1198338823} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198338823, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1198338823|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1198338823} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:15:07,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1333116352 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1333116352 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1333116352 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1333116352 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1333116352| ~z$w_buff1_used~0_In1333116352)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1333116352| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1333116352} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1333116352|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1333116352} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:15:07,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1025733040 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1025733040 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1025733040| ~z$r_buff0_thd2~0_In1025733040)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1025733040| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1025733040, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1025733040} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1025733040, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1025733040, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1025733040|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:15:07,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-34643684 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-34643684 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-34643684 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-34643684 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-34643684|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-34643684 |P1Thread1of1ForFork1_#t~ite37_Out-34643684|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-34643684, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-34643684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-34643684, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-34643684} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-34643684, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-34643684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-34643684, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-34643684, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-34643684|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:15:07,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~z$r_buff1_thd2~0_88) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:15:07,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_16) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:15:07,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1438989481 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1438989481 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out1438989481| |ULTIMATE.start_main_#t~ite41_Out1438989481|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out1438989481| ~z~0_In1438989481)) (and (= |ULTIMATE.start_main_#t~ite40_Out1438989481| ~z$w_buff1~0_In1438989481) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1438989481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1438989481, ~z$w_buff1~0=~z$w_buff1~0_In1438989481, ~z~0=~z~0_In1438989481} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1438989481|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1438989481|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1438989481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1438989481, ~z$w_buff1~0=~z$w_buff1~0_In1438989481, ~z~0=~z~0_In1438989481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:15:07,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-133635313 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-133635313 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-133635313| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-133635313 |ULTIMATE.start_main_#t~ite42_Out-133635313|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-133635313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-133635313} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-133635313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-133635313, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-133635313|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:15:07,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-151572089 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-151572089 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-151572089 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-151572089 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-151572089| ~z$w_buff1_used~0_In-151572089) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-151572089| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-151572089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151572089} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-151572089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151572089, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-151572089|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:15:07,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1584441186 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1584441186 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1584441186|)) (and (= ~z$r_buff0_thd0~0_In1584441186 |ULTIMATE.start_main_#t~ite44_Out1584441186|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1584441186, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1584441186} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1584441186, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1584441186, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1584441186|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:15:07,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1881095922 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1881095922 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1881095922 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1881095922 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1881095922|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1881095922 |ULTIMATE.start_main_#t~ite45_Out1881095922|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1881095922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1881095922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1881095922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1881095922} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1881095922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1881095922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1881095922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1881095922, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1881095922|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:15:07,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_22 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:07,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:15:07 BasicIcfg [2019-11-28 18:15:07,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:15:07,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:15:07,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:15:07,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:15:07,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:51" (3/4) ... [2019-11-28 18:15:07,374 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:15:07,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27|) |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27| 1)) (= v_~z$w_buff0~0_252 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1093~0.base_27|) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1093~0.base_27| 4)) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= v_~z$w_buff1_used~0_306 0) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_27|, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:07,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff0_thd1~0_In611635474 ~z$r_buff1_thd1~0_Out611635474) (= ~z$r_buff1_thd0~0_Out611635474 ~z$r_buff0_thd0~0_In611635474) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In611635474)) (= ~z$r_buff1_thd2~0_Out611635474 ~z$r_buff0_thd2~0_In611635474) (= ~z$r_buff0_thd1~0_Out611635474 1) (= 1 ~x~0_Out611635474)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In611635474, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In611635474, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In611635474, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out611635474, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out611635474, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out611635474, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In611635474, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out611635474, ~x~0=~x~0_Out611635474, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In611635474} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:07,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-11-28 18:15:07,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2059197966 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2059197966 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2059197966| ~z$w_buff0_used~0_In-2059197966)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2059197966| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2059197966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2059197966} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2059197966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2059197966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2059197966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:07,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1099530092 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1099530092 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1099530092 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1099530092 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1099530092|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1099530092| ~z$w_buff1_used~0_In-1099530092)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1099530092, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1099530092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1099530092, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1099530092} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1099530092|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1099530092, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1099530092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1099530092, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1099530092} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:07,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In773364772 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In773364772 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In773364772 ~z$r_buff0_thd1~0_Out773364772))) (or (and (= 0 ~z$r_buff0_thd1~0_Out773364772) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In773364772, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In773364772} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In773364772, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out773364772|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out773364772} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:15:07,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2106975105 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In2106975105 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In2106975105 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2106975105 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out2106975105| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In2106975105 |P0Thread1of1ForFork0_#t~ite8_Out2106975105|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2106975105, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2106975105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106975105, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2106975105} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2106975105, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2106975105|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2106975105, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106975105, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2106975105} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:07,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:15:07,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:15:07,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1517616419 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1517616419 256)))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In1517616419 256) 0)) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1517616419 256))) (= (mod ~z$w_buff0_used~0_In1517616419 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out1517616419| ~z$r_buff1_thd2~0_In1517616419) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out1517616419| |P1Thread1of1ForFork1_#t~ite30_Out1517616419|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out1517616419| ~z$r_buff1_thd2~0_In1517616419) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1517616419| |P1Thread1of1ForFork1_#t~ite29_Out1517616419|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1517616419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1517616419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517616419, ~weak$$choice2~0=~weak$$choice2~0_In1517616419, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1517616419} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1517616419|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1517616419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517616419, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1517616419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517616419, ~weak$$choice2~0=~weak$$choice2~0_In1517616419, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1517616419} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:15:07,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:15:07,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In217558017 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In217558017 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In217558017 |P1Thread1of1ForFork1_#t~ite32_Out217558017|)) (and (= ~z~0_In217558017 |P1Thread1of1ForFork1_#t~ite32_Out217558017|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In217558017, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217558017, ~z$w_buff1~0=~z$w_buff1~0_In217558017, ~z~0=~z~0_In217558017} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In217558017, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217558017, ~z$w_buff1~0=~z$w_buff1~0_In217558017, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out217558017|, ~z~0=~z~0_In217558017} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:15:07,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |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|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-11-28 18:15:07,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1198338823 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1198338823 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1198338823| ~z$w_buff0_used~0_In-1198338823)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1198338823| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198338823, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1198338823} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1198338823, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1198338823|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1198338823} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:15:07,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1333116352 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1333116352 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1333116352 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1333116352 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1333116352| ~z$w_buff1_used~0_In1333116352)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1333116352| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1333116352} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1333116352, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1333116352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333116352, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1333116352|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1333116352} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:15:07,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1025733040 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1025733040 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1025733040| ~z$r_buff0_thd2~0_In1025733040)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1025733040| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1025733040, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1025733040} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1025733040, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1025733040, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1025733040|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:15:07,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-34643684 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-34643684 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-34643684 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-34643684 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-34643684|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-34643684 |P1Thread1of1ForFork1_#t~ite37_Out-34643684|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-34643684, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-34643684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-34643684, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-34643684} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-34643684, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-34643684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-34643684, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-34643684, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-34643684|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:15:07,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~z$r_buff1_thd2~0_88) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:15:07,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_16) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:15:07,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1438989481 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1438989481 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out1438989481| |ULTIMATE.start_main_#t~ite41_Out1438989481|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out1438989481| ~z~0_In1438989481)) (and (= |ULTIMATE.start_main_#t~ite40_Out1438989481| ~z$w_buff1~0_In1438989481) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1438989481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1438989481, ~z$w_buff1~0=~z$w_buff1~0_In1438989481, ~z~0=~z~0_In1438989481} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1438989481|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1438989481|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1438989481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1438989481, ~z$w_buff1~0=~z$w_buff1~0_In1438989481, ~z~0=~z~0_In1438989481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:15:07,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-133635313 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-133635313 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-133635313| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-133635313 |ULTIMATE.start_main_#t~ite42_Out-133635313|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-133635313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-133635313} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-133635313, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-133635313, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-133635313|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:15:07,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-151572089 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-151572089 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-151572089 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-151572089 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-151572089| ~z$w_buff1_used~0_In-151572089) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-151572089| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-151572089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151572089} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-151572089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-151572089, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-151572089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151572089, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-151572089|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:15:07,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1584441186 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1584441186 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1584441186|)) (and (= ~z$r_buff0_thd0~0_In1584441186 |ULTIMATE.start_main_#t~ite44_Out1584441186|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1584441186, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1584441186} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1584441186, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1584441186, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1584441186|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:15:07,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1881095922 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1881095922 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1881095922 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1881095922 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1881095922|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1881095922 |ULTIMATE.start_main_#t~ite45_Out1881095922|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1881095922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1881095922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1881095922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1881095922} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1881095922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1881095922, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1881095922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1881095922, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1881095922|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:15:07,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_22 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:07,814 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:15:07,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:15:07,816 INFO L168 Benchmark]: Toolchain (without parser) took 18018.49 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 893.9 MB). Free memory was 952.3 MB in the beginning and 1.7 GB in the end (delta: -719.2 MB). Peak memory consumption was 798.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:07,816 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:07,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -93.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:07,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:07,818 INFO L168 Benchmark]: Boogie Preprocessor took 42.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:07,820 INFO L168 Benchmark]: RCFGBuilder took 788.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:07,822 INFO L168 Benchmark]: TraceAbstraction took 15880.14 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 383.8 MB). Free memory was 992.4 MB in the beginning and 652.4 MB in the end (delta: 340.0 MB). Peak memory consumption was 723.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:07,822 INFO L168 Benchmark]: Witness Printer took 446.90 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 429.9 MB). Free memory was 652.4 MB in the beginning and 1.7 GB in the end (delta: -1.0 GB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:07,824 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.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 772.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -93.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 788.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15880.14 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 383.8 MB). Free memory was 992.4 MB in the beginning and 652.4 MB in the end (delta: 340.0 MB). Peak memory consumption was 723.8 MB. Max. memory is 11.5 GB. * Witness Printer took 446.90 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 429.9 MB). Free memory was 652.4 MB in the beginning and 1.7 GB in the end (delta: -1.0 GB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2065 SDtfs, 1633 SDslu, 3490 SDs, 0 SdLazy, 1578 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18980occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 13430 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 51420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...