./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdedd2c6a1c364b12302caa45346a9281105eb2c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-6b5699a [2019-11-25 08:48:35,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:35,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:35,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:35,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:35,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:35,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:35,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:35,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:35,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:35,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:35,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:35,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:35,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:35,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:35,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:35,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:35,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:35,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:35,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:35,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:35,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:35,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:35,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:35,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:35,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:35,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:35,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:35,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:35,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:35,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:35,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:35,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:35,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:35,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:35,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:35,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:35,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:35,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:35,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:35,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:35,673 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:48:35,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:35,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:35,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:35,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:35,709 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:35,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:35,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:48:35,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:35,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:48:35,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:35,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:48:35,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:48:35,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:48:35,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:48:35,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:35,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:35,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:48:35,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:35,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:35,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:48:35,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:48:35,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:35,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:35,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:48:35,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:48:35,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:35,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:48:35,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:48:35,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdedd2c6a1c364b12302caa45346a9281105eb2c [2019-11-25 08:48:35,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:35,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:35,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:35,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:35,898 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:35,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i [2019-11-25 08:48:35,959 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/data/5f23111be/a6634c77901a40ff9f44083c4ae198ac/FLAG91d08b536 [2019-11-25 08:48:36,440 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:36,441 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i [2019-11-25 08:48:36,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/data/5f23111be/a6634c77901a40ff9f44083c4ae198ac/FLAG91d08b536 [2019-11-25 08:48:36,923 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/data/5f23111be/a6634c77901a40ff9f44083c4ae198ac [2019-11-25 08:48:36,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:36,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:36,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:36,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:36,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:36,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:36" (1/1) ... [2019-11-25 08:48:36,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507bfb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:36, skipping insertion in model container [2019-11-25 08:48:36,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:36" (1/1) ... [2019-11-25 08:48:36,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:36,990 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:37,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:37,381 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:48:37,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:37,541 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:48:37,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37 WrapperNode [2019-11-25 08:48:37,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:37,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:37,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:48:37,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:48:37,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:37,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:48:37,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:48:37,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:48:37,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... [2019-11-25 08:48:37,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:48:37,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:48:37,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:48:37,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:48:37,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:48:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:48:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:48:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:48:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:48:37,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:48:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:48:37,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:48:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:48:37,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:48:37,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:48:37,754 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:48:38,355 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:48:38,355 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:48:38,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:38 BoogieIcfgContainer [2019-11-25 08:48:38,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:48:38,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:48:38,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:48:38,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:48:38,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:48:36" (1/3) ... [2019-11-25 08:48:38,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b020a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:38, skipping insertion in model container [2019-11-25 08:48:38,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:37" (2/3) ... [2019-11-25 08:48:38,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b020a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:38, skipping insertion in model container [2019-11-25 08:48:38,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:38" (3/3) ... [2019-11-25 08:48:38,364 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.oepc.i [2019-11-25 08:48:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,501 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:38,532 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:48:38,532 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:48:38,544 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:48:38,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:48:38,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:48:38,574 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:48:38,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:48:38,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:48:38,575 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:48:38,575 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:48:38,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:48:38,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:48:38,603 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 348 transitions [2019-11-25 08:48:40,435 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-11-25 08:48:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-11-25 08:48:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:48:40,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:40,447 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] [2019-11-25 08:48:40,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1129759359, now seen corresponding path program 1 times [2019-11-25 08:48:40,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:40,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407282428] [2019-11-25 08:48:40,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:40,705 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-25 08:48:40,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407282428] [2019-11-25 08:48:40,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:40,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:40,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833334204] [2019-11-25 08:48:40,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:40,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:40,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:40,732 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-11-25 08:48:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:41,536 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-11-25 08:48:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:41,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-25 08:48:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:41,764 INFO L225 Difference]: With dead ends: 26614 [2019-11-25 08:48:41,764 INFO L226 Difference]: Without dead ends: 20358 [2019-11-25 08:48:41,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-11-25 08:48:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-11-25 08:48:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-11-25 08:48:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-11-25 08:48:43,001 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-11-25 08:48:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:43,003 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-11-25 08:48:43,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-11-25 08:48:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:48:43,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:43,016 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] [2019-11-25 08:48:43,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash 530677364, now seen corresponding path program 1 times [2019-11-25 08:48:43,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:43,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639707692] [2019-11-25 08:48:43,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:48:43,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639707692] [2019-11-25 08:48:43,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:43,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:43,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607633884] [2019-11-25 08:48:43,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:43,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:43,182 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-11-25 08:48:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:44,485 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-11-25 08:48:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:48:44,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-25 08:48:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:44,621 INFO L225 Difference]: With dead ends: 31836 [2019-11-25 08:48:44,622 INFO L226 Difference]: Without dead ends: 31284 [2019-11-25 08:48:44,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:48:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-11-25 08:48:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-11-25 08:48:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-11-25 08:48:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-11-25 08:48:45,543 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-11-25 08:48:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:45,544 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-11-25 08:48:45,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-11-25 08:48:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 08:48:45,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:45,551 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] [2019-11-25 08:48:45,551 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:45,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1355560122, now seen corresponding path program 1 times [2019-11-25 08:48:45,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:45,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484775269] [2019-11-25 08:48:45,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:45,941 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-25 08:48:45,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484775269] [2019-11-25 08:48:45,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:45,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:45,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423992405] [2019-11-25 08:48:45,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:45,943 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-11-25 08:48:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:46,452 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-11-25 08:48:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:48:46,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-25 08:48:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:46,710 INFO L225 Difference]: With dead ends: 38694 [2019-11-25 08:48:46,710 INFO L226 Difference]: Without dead ends: 38246 [2019-11-25 08:48:46,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:48:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-11-25 08:48:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-11-25 08:48:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-11-25 08:48:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-11-25 08:48:47,665 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-11-25 08:48:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:47,666 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-11-25 08:48:47,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-11-25 08:48:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:48:47,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:47,676 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] [2019-11-25 08:48:47,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash -560493652, now seen corresponding path program 1 times [2019-11-25 08:48:47,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:47,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276718915] [2019-11-25 08:48:47,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:47,721 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-25 08:48:47,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276718915] [2019-11-25 08:48:47,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:47,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:47,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44675474] [2019-11-25 08:48:47,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:47,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:47,724 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-11-25 08:48:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:48,388 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-11-25 08:48:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:48,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-25 08:48:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:48,515 INFO L225 Difference]: With dead ends: 42410 [2019-11-25 08:48:48,515 INFO L226 Difference]: Without dead ends: 42410 [2019-11-25 08:48:48,516 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-25 08:48:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-11-25 08:48:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-11-25 08:48:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-11-25 08:48:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-11-25 08:48:49,445 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-11-25 08:48:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:49,445 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-11-25 08:48:49,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-11-25 08:48:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:48:49,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:49,468 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-25 08:48:49,468 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash -43798609, now seen corresponding path program 1 times [2019-11-25 08:48:49,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:49,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059902604] [2019-11-25 08:48:49,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:49,566 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-25 08:48:49,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059902604] [2019-11-25 08:48:49,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:49,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:48:49,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175425966] [2019-11-25 08:48:49,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:49,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:49,569 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 6 states. [2019-11-25 08:48:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:50,774 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-11-25 08:48:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:48:50,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-25 08:48:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:50,915 INFO L225 Difference]: With dead ends: 48754 [2019-11-25 08:48:50,915 INFO L226 Difference]: Without dead ends: 48234 [2019-11-25 08:48:50,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:48:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-11-25 08:48:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-11-25 08:48:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-11-25 08:48:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-11-25 08:48:51,886 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-11-25 08:48:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:51,886 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-11-25 08:48:51,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-11-25 08:48:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:48:51,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:51,914 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-25 08:48:51,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash 863719927, now seen corresponding path program 1 times [2019-11-25 08:48:51,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:51,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887010050] [2019-11-25 08:48:51,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:52,094 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-25 08:48:52,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887010050] [2019-11-25 08:48:52,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:52,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:48:52,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668778236] [2019-11-25 08:48:52,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:52,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:52,097 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-11-25 08:48:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:52,880 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-11-25 08:48:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:48:52,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-25 08:48:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:53,054 INFO L225 Difference]: With dead ends: 53003 [2019-11-25 08:48:53,054 INFO L226 Difference]: Without dead ends: 52027 [2019-11-25 08:48:53,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:48:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-11-25 08:48:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-11-25 08:48:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-11-25 08:48:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-11-25 08:48:54,553 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-11-25 08:48:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:54,553 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-11-25 08:48:54,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-11-25 08:48:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:48:54,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:54,570 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-25 08:48:54,571 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -933231432, now seen corresponding path program 1 times [2019-11-25 08:48:54,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:54,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650766132] [2019-11-25 08:48:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:54,663 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-25 08:48:54,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650766132] [2019-11-25 08:48:54,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:54,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:48:54,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714412993] [2019-11-25 08:48:54,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:48:54,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:48:54,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:48:54,665 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-11-25 08:48:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:55,577 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-11-25 08:48:55,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:48:55,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-25 08:48:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:55,702 INFO L225 Difference]: With dead ends: 70895 [2019-11-25 08:48:55,702 INFO L226 Difference]: Without dead ends: 70895 [2019-11-25 08:48:55,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:48:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-11-25 08:48:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-11-25 08:48:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-11-25 08:48:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-11-25 08:48:57,450 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-11-25 08:48:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:57,450 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-11-25 08:48:57,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:48:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-11-25 08:48:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:48:57,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:57,466 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-25 08:48:57,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:57,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash -45727751, now seen corresponding path program 1 times [2019-11-25 08:48:57,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:57,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348089079] [2019-11-25 08:48:57,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:57,536 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-25 08:48:57,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348089079] [2019-11-25 08:48:57,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:57,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:57,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583670760] [2019-11-25 08:48:57,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:57,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:57,537 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 4 states. [2019-11-25 08:48:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:57,598 INFO L93 Difference]: Finished difference Result 10858 states and 33393 transitions. [2019-11-25 08:48:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:48:57,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-25 08:48:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:57,616 INFO L225 Difference]: With dead ends: 10858 [2019-11-25 08:48:57,616 INFO L226 Difference]: Without dead ends: 9359 [2019-11-25 08:48:57,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 08:48:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2019-11-25 08:48:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9311. [2019-11-25 08:48:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9311 states. [2019-11-25 08:48:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 28343 transitions. [2019-11-25 08:48:57,743 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 28343 transitions. Word has length 52 [2019-11-25 08:48:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:57,743 INFO L462 AbstractCegarLoop]: Abstraction has 9311 states and 28343 transitions. [2019-11-25 08:48:57,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 28343 transitions. [2019-11-25 08:48:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:48:57,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:57,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:57,748 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1156284571, now seen corresponding path program 1 times [2019-11-25 08:48:57,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:57,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737679792] [2019-11-25 08:48:57,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:57,816 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-25 08:48:57,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737679792] [2019-11-25 08:48:57,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:57,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:57,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253147757] [2019-11-25 08:48:57,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:57,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:57,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:57,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:57,821 INFO L87 Difference]: Start difference. First operand 9311 states and 28343 transitions. Second operand 4 states. [2019-11-25 08:48:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:58,004 INFO L93 Difference]: Finished difference Result 10886 states and 33035 transitions. [2019-11-25 08:48:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:48:58,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:48:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:58,024 INFO L225 Difference]: With dead ends: 10886 [2019-11-25 08:48:58,024 INFO L226 Difference]: Without dead ends: 10886 [2019-11-25 08:48:58,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-25 08:48:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-11-25 08:48:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 9878. [2019-11-25 08:48:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9878 states. [2019-11-25 08:48:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 30014 transitions. [2019-11-25 08:48:58,214 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 30014 transitions. Word has length 62 [2019-11-25 08:48:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:58,215 INFO L462 AbstractCegarLoop]: Abstraction has 9878 states and 30014 transitions. [2019-11-25 08:48:58,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 30014 transitions. [2019-11-25 08:48:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:48:58,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:58,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:58,223 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:58,223 INFO L82 PathProgramCache]: Analyzing trace with hash 586525764, now seen corresponding path program 1 times [2019-11-25 08:48:58,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:58,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527745220] [2019-11-25 08:48:58,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:58,369 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-25 08:48:58,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527745220] [2019-11-25 08:48:58,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:58,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:48:58,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655552681] [2019-11-25 08:48:58,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:58,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:58,371 INFO L87 Difference]: Start difference. First operand 9878 states and 30014 transitions. Second operand 6 states. [2019-11-25 08:48:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:58,899 INFO L93 Difference]: Finished difference Result 12784 states and 38224 transitions. [2019-11-25 08:48:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:48:58,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-25 08:48:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:58,922 INFO L225 Difference]: With dead ends: 12784 [2019-11-25 08:48:58,922 INFO L226 Difference]: Without dead ends: 12736 [2019-11-25 08:48:58,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:48:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12736 states. [2019-11-25 08:48:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12736 to 10617. [2019-11-25 08:48:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10617 states. [2019-11-25 08:48:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10617 states to 10617 states and 32067 transitions. [2019-11-25 08:48:59,103 INFO L78 Accepts]: Start accepts. Automaton has 10617 states and 32067 transitions. Word has length 62 [2019-11-25 08:48:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:59,103 INFO L462 AbstractCegarLoop]: Abstraction has 10617 states and 32067 transitions. [2019-11-25 08:48:59,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10617 states and 32067 transitions. [2019-11-25 08:48:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:48:59,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:59,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:59,110 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1604978825, now seen corresponding path program 1 times [2019-11-25 08:48:59,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:59,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128969007] [2019-11-25 08:48:59,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:59,175 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-25 08:48:59,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128969007] [2019-11-25 08:48:59,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:59,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:59,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347084069] [2019-11-25 08:48:59,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:59,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:59,176 INFO L87 Difference]: Start difference. First operand 10617 states and 32067 transitions. Second operand 4 states. [2019-11-25 08:48:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:59,379 INFO L93 Difference]: Finished difference Result 13319 states and 39669 transitions. [2019-11-25 08:48:59,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:59,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-25 08:48:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:59,395 INFO L225 Difference]: With dead ends: 13319 [2019-11-25 08:48:59,396 INFO L226 Difference]: Without dead ends: 13319 [2019-11-25 08:48:59,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13319 states. [2019-11-25 08:48:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13319 to 12173. [2019-11-25 08:48:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12173 states. [2019-11-25 08:48:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12173 states to 12173 states and 36358 transitions. [2019-11-25 08:48:59,534 INFO L78 Accepts]: Start accepts. Automaton has 12173 states and 36358 transitions. Word has length 64 [2019-11-25 08:48:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:59,534 INFO L462 AbstractCegarLoop]: Abstraction has 12173 states and 36358 transitions. [2019-11-25 08:48:59,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 12173 states and 36358 transitions. [2019-11-25 08:48:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:48:59,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:59,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:59,543 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -472230518, now seen corresponding path program 1 times [2019-11-25 08:48:59,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:59,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746113153] [2019-11-25 08:48:59,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:59,581 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-25 08:48:59,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746113153] [2019-11-25 08:48:59,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:59,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:59,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960667085] [2019-11-25 08:48:59,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:59,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:59,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:59,582 INFO L87 Difference]: Start difference. First operand 12173 states and 36358 transitions. Second operand 3 states. [2019-11-25 08:48:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:59,769 INFO L93 Difference]: Finished difference Result 12699 states and 37763 transitions. [2019-11-25 08:48:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:59,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-25 08:48:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:59,786 INFO L225 Difference]: With dead ends: 12699 [2019-11-25 08:48:59,786 INFO L226 Difference]: Without dead ends: 12699 [2019-11-25 08:48:59,786 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-25 08:48:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12699 states. [2019-11-25 08:48:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12699 to 12461. [2019-11-25 08:48:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12461 states. [2019-11-25 08:48:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12461 states to 12461 states and 37122 transitions. [2019-11-25 08:48:59,949 INFO L78 Accepts]: Start accepts. Automaton has 12461 states and 37122 transitions. Word has length 64 [2019-11-25 08:48:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:59,949 INFO L462 AbstractCegarLoop]: Abstraction has 12461 states and 37122 transitions. [2019-11-25 08:48:59,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 12461 states and 37122 transitions. [2019-11-25 08:48:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:48:59,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:59,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:59,960 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:48:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1050150005, now seen corresponding path program 1 times [2019-11-25 08:48:59,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:59,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737054246] [2019-11-25 08:48:59,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:00,080 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-25 08:49:00,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737054246] [2019-11-25 08:49:00,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:00,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:00,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479681622] [2019-11-25 08:49:00,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:00,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:00,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:00,082 INFO L87 Difference]: Start difference. First operand 12461 states and 37122 transitions. Second operand 6 states. [2019-11-25 08:49:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:00,628 INFO L93 Difference]: Finished difference Result 13732 states and 40361 transitions. [2019-11-25 08:49:00,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:00,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-25 08:49:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:00,655 INFO L225 Difference]: With dead ends: 13732 [2019-11-25 08:49:00,655 INFO L226 Difference]: Without dead ends: 13732 [2019-11-25 08:49:00,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-11-25 08:49:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 13246. [2019-11-25 08:49:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-11-25 08:49:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 39077 transitions. [2019-11-25 08:49:00,890 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 39077 transitions. Word has length 66 [2019-11-25 08:49:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:00,890 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 39077 transitions. [2019-11-25 08:49:00,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 39077 transitions. [2019-11-25 08:49:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:49:00,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:00,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:00,908 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1027059338, now seen corresponding path program 1 times [2019-11-25 08:49:00,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:00,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773064392] [2019-11-25 08:49:00,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:01,006 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-25 08:49:01,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773064392] [2019-11-25 08:49:01,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:01,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:01,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547503694] [2019-11-25 08:49:01,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:01,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:01,007 INFO L87 Difference]: Start difference. First operand 13246 states and 39077 transitions. Second operand 6 states. [2019-11-25 08:49:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:01,359 INFO L93 Difference]: Finished difference Result 15569 states and 44587 transitions. [2019-11-25 08:49:01,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:49:01,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-25 08:49:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:01,378 INFO L225 Difference]: With dead ends: 15569 [2019-11-25 08:49:01,378 INFO L226 Difference]: Without dead ends: 15569 [2019-11-25 08:49:01,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:49:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-11-25 08:49:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 13820. [2019-11-25 08:49:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13820 states. [2019-11-25 08:49:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13820 states to 13820 states and 39927 transitions. [2019-11-25 08:49:01,554 INFO L78 Accepts]: Start accepts. Automaton has 13820 states and 39927 transitions. Word has length 66 [2019-11-25 08:49:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:01,554 INFO L462 AbstractCegarLoop]: Abstraction has 13820 states and 39927 transitions. [2019-11-25 08:49:01,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 13820 states and 39927 transitions. [2019-11-25 08:49:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:49:01,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:01,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:01,563 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:01,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:01,563 INFO L82 PathProgramCache]: Analyzing trace with hash -815708425, now seen corresponding path program 1 times [2019-11-25 08:49:01,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:01,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343729897] [2019-11-25 08:49:01,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:01,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343729897] [2019-11-25 08:49:01,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:01,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:01,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661106846] [2019-11-25 08:49:01,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:01,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:01,637 INFO L87 Difference]: Start difference. First operand 13820 states and 39927 transitions. Second operand 5 states. [2019-11-25 08:49:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:01,922 INFO L93 Difference]: Finished difference Result 17381 states and 50006 transitions. [2019-11-25 08:49:01,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:49:01,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 08:49:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:01,943 INFO L225 Difference]: With dead ends: 17381 [2019-11-25 08:49:01,943 INFO L226 Difference]: Without dead ends: 17381 [2019-11-25 08:49:01,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2019-11-25 08:49:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 14858. [2019-11-25 08:49:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14858 states. [2019-11-25 08:49:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14858 states to 14858 states and 42559 transitions. [2019-11-25 08:49:02,133 INFO L78 Accepts]: Start accepts. Automaton has 14858 states and 42559 transitions. Word has length 66 [2019-11-25 08:49:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,134 INFO L462 AbstractCegarLoop]: Abstraction has 14858 states and 42559 transitions. [2019-11-25 08:49:02,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14858 states and 42559 transitions. [2019-11-25 08:49:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:49:02,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:02,147 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1326242602, now seen corresponding path program 1 times [2019-11-25 08:49:02,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668657799] [2019-11-25 08:49:02,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:02,687 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-25 08:49:02,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668657799] [2019-11-25 08:49:02,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:02,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:02,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190142529] [2019-11-25 08:49:02,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:02,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:02,689 INFO L87 Difference]: Start difference. First operand 14858 states and 42559 transitions. Second operand 5 states. [2019-11-25 08:49:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:03,041 INFO L93 Difference]: Finished difference Result 19763 states and 56506 transitions. [2019-11-25 08:49:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:03,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 08:49:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:03,062 INFO L225 Difference]: With dead ends: 19763 [2019-11-25 08:49:03,063 INFO L226 Difference]: Without dead ends: 19763 [2019-11-25 08:49:03,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2019-11-25 08:49:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 15763. [2019-11-25 08:49:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15763 states. [2019-11-25 08:49:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15763 states to 15763 states and 45145 transitions. [2019-11-25 08:49:03,268 INFO L78 Accepts]: Start accepts. Automaton has 15763 states and 45145 transitions. Word has length 66 [2019-11-25 08:49:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:03,268 INFO L462 AbstractCegarLoop]: Abstraction has 15763 states and 45145 transitions. [2019-11-25 08:49:03,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 15763 states and 45145 transitions. [2019-11-25 08:49:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:49:03,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:03,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:03,279 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1161270231, now seen corresponding path program 1 times [2019-11-25 08:49:03,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:03,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367180964] [2019-11-25 08:49:03,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:03,385 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-25 08:49:03,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367180964] [2019-11-25 08:49:03,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:03,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:03,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820726727] [2019-11-25 08:49:03,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:03,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:03,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:03,387 INFO L87 Difference]: Start difference. First operand 15763 states and 45145 transitions. Second operand 4 states. [2019-11-25 08:49:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:03,760 INFO L93 Difference]: Finished difference Result 20659 states and 59353 transitions. [2019-11-25 08:49:03,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:03,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:49:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:03,786 INFO L225 Difference]: With dead ends: 20659 [2019-11-25 08:49:03,786 INFO L226 Difference]: Without dead ends: 20383 [2019-11-25 08:49:03,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-25 08:49:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-11-25 08:49:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 18946. [2019-11-25 08:49:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18946 states. [2019-11-25 08:49:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18946 states to 18946 states and 54434 transitions. [2019-11-25 08:49:04,033 INFO L78 Accepts]: Start accepts. Automaton has 18946 states and 54434 transitions. Word has length 66 [2019-11-25 08:49:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,033 INFO L462 AbstractCegarLoop]: Abstraction has 18946 states and 54434 transitions. [2019-11-25 08:49:04,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 18946 states and 54434 transitions. [2019-11-25 08:49:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:49:04,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,044 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,044 INFO L82 PathProgramCache]: Analyzing trace with hash -635681128, now seen corresponding path program 1 times [2019-11-25 08:49:04,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789874685] [2019-11-25 08:49:04,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,173 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-25 08:49:04,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789874685] [2019-11-25 08:49:04,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:49:04,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133825579] [2019-11-25 08:49:04,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:49:04,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:49:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:04,174 INFO L87 Difference]: Start difference. First operand 18946 states and 54434 transitions. Second operand 7 states. [2019-11-25 08:49:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,529 INFO L93 Difference]: Finished difference Result 17840 states and 48888 transitions. [2019-11-25 08:49:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:49:04,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-25 08:49:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,549 INFO L225 Difference]: With dead ends: 17840 [2019-11-25 08:49:04,549 INFO L226 Difference]: Without dead ends: 17840 [2019-11-25 08:49:04,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:49:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2019-11-25 08:49:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 12474. [2019-11-25 08:49:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12474 states. [2019-11-25 08:49:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 34351 transitions. [2019-11-25 08:49:04,728 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 34351 transitions. Word has length 66 [2019-11-25 08:49:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,728 INFO L462 AbstractCegarLoop]: Abstraction has 12474 states and 34351 transitions. [2019-11-25 08:49:04,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:49:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 34351 transitions. [2019-11-25 08:49:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:49:04,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,735 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 251822553, now seen corresponding path program 1 times [2019-11-25 08:49:04,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531741864] [2019-11-25 08:49:04,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,808 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-25 08:49:04,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531741864] [2019-11-25 08:49:04,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:04,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249459408] [2019-11-25 08:49:04,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:04,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:04,809 INFO L87 Difference]: Start difference. First operand 12474 states and 34351 transitions. Second operand 5 states. [2019-11-25 08:49:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,864 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-11-25 08:49:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:49:04,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 08:49:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,868 INFO L225 Difference]: With dead ends: 4023 [2019-11-25 08:49:04,868 INFO L226 Difference]: Without dead ends: 3350 [2019-11-25 08:49:04,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-11-25 08:49:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-11-25 08:49:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-11-25 08:49:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-11-25 08:49:04,909 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-11-25 08:49:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,909 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-11-25 08:49:04,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-11-25 08:49:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:49:04,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,913 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash -68109150, now seen corresponding path program 1 times [2019-11-25 08:49:04,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238670570] [2019-11-25 08:49:04,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,988 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-25 08:49:04,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238670570] [2019-11-25 08:49:04,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:04,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930571627] [2019-11-25 08:49:04,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:04,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:04,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:04,990 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 5 states. [2019-11-25 08:49:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,197 INFO L93 Difference]: Finished difference Result 3586 states and 8096 transitions. [2019-11-25 08:49:05,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:05,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-25 08:49:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,200 INFO L225 Difference]: With dead ends: 3586 [2019-11-25 08:49:05,200 INFO L226 Difference]: Without dead ends: 3564 [2019-11-25 08:49:05,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-25 08:49:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3183. [2019-11-25 08:49:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-25 08:49:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 7262 transitions. [2019-11-25 08:49:05,228 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 7262 transitions. Word has length 83 [2019-11-25 08:49:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,228 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 7262 transitions. [2019-11-25 08:49:05,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 7262 transitions. [2019-11-25 08:49:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:49:05,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,231 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,231 INFO L82 PathProgramCache]: Analyzing trace with hash -291825888, now seen corresponding path program 1 times [2019-11-25 08:49:05,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61025309] [2019-11-25 08:49:05,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,332 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-25 08:49:05,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61025309] [2019-11-25 08:49:05,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:05,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390146251] [2019-11-25 08:49:05,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:05,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:05,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:05,334 INFO L87 Difference]: Start difference. First operand 3183 states and 7262 transitions. Second operand 6 states. [2019-11-25 08:49:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,551 INFO L93 Difference]: Finished difference Result 3165 states and 7192 transitions. [2019-11-25 08:49:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:05,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-25 08:49:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,555 INFO L225 Difference]: With dead ends: 3165 [2019-11-25 08:49:05,555 INFO L226 Difference]: Without dead ends: 3165 [2019-11-25 08:49:05,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2019-11-25 08:49:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3089. [2019-11-25 08:49:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-25 08:49:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7030 transitions. [2019-11-25 08:49:05,591 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7030 transitions. Word has length 83 [2019-11-25 08:49:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,592 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7030 transitions. [2019-11-25 08:49:05,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7030 transitions. [2019-11-25 08:49:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:49:05,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,596 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1496830279, now seen corresponding path program 1 times [2019-11-25 08:49:05,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501077759] [2019-11-25 08:49:05,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,696 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-25 08:49:05,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501077759] [2019-11-25 08:49:05,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:05,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701311935] [2019-11-25 08:49:05,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:05,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:05,698 INFO L87 Difference]: Start difference. First operand 3089 states and 7030 transitions. Second operand 5 states. [2019-11-25 08:49:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,736 INFO L93 Difference]: Finished difference Result 3089 states and 7021 transitions. [2019-11-25 08:49:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:05,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-25 08:49:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,740 INFO L225 Difference]: With dead ends: 3089 [2019-11-25 08:49:05,740 INFO L226 Difference]: Without dead ends: 3089 [2019-11-25 08:49:05,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-11-25 08:49:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2797. [2019-11-25 08:49:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-11-25 08:49:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 6391 transitions. [2019-11-25 08:49:05,774 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 6391 transitions. Word has length 83 [2019-11-25 08:49:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,775 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 6391 transitions. [2019-11-25 08:49:05,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 6391 transitions. [2019-11-25 08:49:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:49:05,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,778 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1910633336, now seen corresponding path program 1 times [2019-11-25 08:49:05,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340884349] [2019-11-25 08:49:05,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:05,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340884349] [2019-11-25 08:49:05,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:49:05,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28914224] [2019-11-25 08:49:05,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:49:05,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:49:05,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:05,925 INFO L87 Difference]: Start difference. First operand 2797 states and 6391 transitions. Second operand 7 states. [2019-11-25 08:49:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:06,020 INFO L93 Difference]: Finished difference Result 4757 states and 10954 transitions. [2019-11-25 08:49:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:49:06,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-25 08:49:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:06,023 INFO L225 Difference]: With dead ends: 4757 [2019-11-25 08:49:06,023 INFO L226 Difference]: Without dead ends: 2047 [2019-11-25 08:49:06,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:49:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2019-11-25 08:49:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2047. [2019-11-25 08:49:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-11-25 08:49:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 4707 transitions. [2019-11-25 08:49:06,046 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 4707 transitions. Word has length 83 [2019-11-25 08:49:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:06,047 INFO L462 AbstractCegarLoop]: Abstraction has 2047 states and 4707 transitions. [2019-11-25 08:49:06,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:49:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 4707 transitions. [2019-11-25 08:49:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:49:06,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:06,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:06,050 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1495631300, now seen corresponding path program 2 times [2019-11-25 08:49:06,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:06,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179669338] [2019-11-25 08:49:06,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:06,210 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-25 08:49:06,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179669338] [2019-11-25 08:49:06,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:06,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:49:06,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779622743] [2019-11-25 08:49:06,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:49:06,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:49:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:49:06,212 INFO L87 Difference]: Start difference. First operand 2047 states and 4707 transitions. Second operand 10 states. [2019-11-25 08:49:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:06,706 INFO L93 Difference]: Finished difference Result 4508 states and 10253 transitions. [2019-11-25 08:49:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 08:49:06,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-11-25 08:49:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:06,709 INFO L225 Difference]: With dead ends: 4508 [2019-11-25 08:49:06,709 INFO L226 Difference]: Without dead ends: 2967 [2019-11-25 08:49:06,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-25 08:49:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2019-11-25 08:49:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2116. [2019-11-25 08:49:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-25 08:49:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 4810 transitions. [2019-11-25 08:49:06,742 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 4810 transitions. Word has length 83 [2019-11-25 08:49:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:06,743 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 4810 transitions. [2019-11-25 08:49:06,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:49:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 4810 transitions. [2019-11-25 08:49:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:49:06,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:06,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:06,746 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 930632538, now seen corresponding path program 3 times [2019-11-25 08:49:06,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:06,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539918778] [2019-11-25 08:49:06,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:06,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:06,829 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:49:06,990 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:49:06,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:06 BasicIcfg [2019-11-25 08:49:06,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:06,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:06,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:06,998 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:06,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:38" (3/4) ... [2019-11-25 08:49:07,001 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:49:07,157 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00b211b2-e7b3-4936-8c61-7b5e11a189b1/bin/uautomizer/witness.graphml [2019-11-25 08:49:07,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:07,159 INFO L168 Benchmark]: Toolchain (without parser) took 30232.45 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 946.1 MB in the beginning and 929.0 MB in the end (delta: 17.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-25 08:49:07,160 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:07,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:07,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:07,161 INFO L168 Benchmark]: Boogie Preprocessor took 53.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:07,161 INFO L168 Benchmark]: RCFGBuilder took 678.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:07,161 INFO L168 Benchmark]: TraceAbstraction took 28638.67 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 977.1 MB in the end (delta: 77.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-25 08:49:07,162 INFO L168 Benchmark]: Witness Printer took 160.03 ms. Allocated memory is still 3.1 GB. Free memory was 977.1 MB in the beginning and 929.0 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:07,163 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 678.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28638.67 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 977.1 MB in the end (delta: 77.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 160.03 ms. Allocated memory is still 3.1 GB. Free memory was 977.1 MB in the beginning and 929.0 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2569; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2569, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2570; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2570, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 326 locations, 5 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6326 SDtfs, 7291 SDslu, 13579 SDs, 0 SdLazy, 4749 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred 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: 10.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 59866 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 238982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...