./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/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 45c582a55b36768c961f60ee9b8d5a74fff32f8f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 08:54:59,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:59,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:59,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:59,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:59,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:59,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:59,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:59,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:59,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:59,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:59,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:59,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:59,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:59,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:59,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:59,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:59,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:59,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:59,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:59,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:59,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:59,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:59,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:59,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:59,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:59,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:59,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:59,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:59,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:59,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:59,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:59,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:59,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:59,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:59,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:59,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:59,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:59,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:59,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:59,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:59,993 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:00,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:00,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:00,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:00,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:00,010 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:00,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:00,010 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:00,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:00,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:00,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:00,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:00,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:00,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:00,011 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:00,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:00,012 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:00,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:00,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:00,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:00,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:00,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:00,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:00,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:00,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:00,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:00,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:00,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:00,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:00,014 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/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/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 -> 45c582a55b36768c961f60ee9b8d5a74fff32f8f [2019-10-22 08:55:00,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:00,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:00,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:00,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:00,057 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:00,058 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-10-22 08:55:00,108 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/data/f46bc17aa/f5f0cfcb314c4874840dba1a9a12bb65/FLAG2533fb5d7 [2019-10-22 08:55:00,543 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:00,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-10-22 08:55:00,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/data/f46bc17aa/f5f0cfcb314c4874840dba1a9a12bb65/FLAG2533fb5d7 [2019-10-22 08:55:00,569 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/data/f46bc17aa/f5f0cfcb314c4874840dba1a9a12bb65 [2019-10-22 08:55:00,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:00,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:00,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:00,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:00,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:00,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:00" (1/1) ... [2019-10-22 08:55:00,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bf6310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:00, skipping insertion in model container [2019-10-22 08:55:00,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:00" (1/1) ... [2019-10-22 08:55:00,587 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:00,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:01,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:01,162 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:01,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:01,272 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:01,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01 WrapperNode [2019-10-22 08:55:01,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:01,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:01,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:01,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:01,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:01,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:01,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:01,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:01,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:01,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:01,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:01,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:01,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/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-10-22 08:55:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 08:55:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 08:55:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 08:55:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 08:55:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 08:55:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 08:55:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:01,418 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 08:55:01,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:01,979 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:01,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:01 BoogieIcfgContainer [2019-10-22 08:55:01,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:01,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:01,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:01,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:01,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:00" (1/3) ... [2019-10-22 08:55:01,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3338ee51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:01, skipping insertion in model container [2019-10-22 08:55:01,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01" (2/3) ... [2019-10-22 08:55:01,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3338ee51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:01, skipping insertion in model container [2019-10-22 08:55:01,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:01" (3/3) ... [2019-10-22 08:55:01,987 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-10-22 08:55:02,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,034 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,035 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,035 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,035 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,035 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,050 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,050 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,050 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,050 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,051 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:55:02,063 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 08:55:02,063 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:02,070 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:55:02,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:55:02,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:02,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:02,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:02,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:02,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:02,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:02,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:02,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:02,110 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 166 transitions [2019-10-22 08:55:04,244 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2019-10-22 08:55:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2019-10-22 08:55:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:55:04,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:04,255 INFO L380 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] [2019-10-22 08:55:04,257 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash -379972106, now seen corresponding path program 1 times [2019-10-22 08:55:04,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:04,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061204933] [2019-10-22 08:55:04,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:04,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:04,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:04,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061204933] [2019-10-22 08:55:04,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:04,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:04,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979466563] [2019-10-22 08:55:04,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:04,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:04,566 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2019-10-22 08:55:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:05,214 INFO L93 Difference]: Finished difference Result 28526 states and 108883 transitions. [2019-10-22 08:55:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:05,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-22 08:55:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:05,412 INFO L225 Difference]: With dead ends: 28526 [2019-10-22 08:55:05,413 INFO L226 Difference]: Without dead ends: 21758 [2019-10-22 08:55:05,414 INFO L600 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-10-22 08:55:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21758 states. [2019-10-22 08:55:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21758 to 21758. [2019-10-22 08:55:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2019-10-22 08:55:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2019-10-22 08:55:06,538 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2019-10-22 08:55:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:06,538 INFO L462 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2019-10-22 08:55:06,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2019-10-22 08:55:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:55:06,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:06,549 INFO L380 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] [2019-10-22 08:55:06,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash -750842194, now seen corresponding path program 1 times [2019-10-22 08:55:06,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:06,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083116871] [2019-10-22 08:55:06,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:06,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083116871] [2019-10-22 08:55:06,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:06,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:06,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647775933] [2019-10-22 08:55:06,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:06,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:06,686 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 5 states. [2019-10-22 08:55:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:07,971 INFO L93 Difference]: Finished difference Result 34172 states and 124043 transitions. [2019-10-22 08:55:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:07,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-22 08:55:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:08,105 INFO L225 Difference]: With dead ends: 34172 [2019-10-22 08:55:08,105 INFO L226 Difference]: Without dead ends: 33604 [2019-10-22 08:55:08,106 INFO L600 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-10-22 08:55:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33604 states. [2019-10-22 08:55:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33604 to 31798. [2019-10-22 08:55:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31798 states. [2019-10-22 08:55:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31798 states to 31798 states and 116821 transitions. [2019-10-22 08:55:09,479 INFO L78 Accepts]: Start accepts. Automaton has 31798 states and 116821 transitions. Word has length 49 [2019-10-22 08:55:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:09,480 INFO L462 AbstractCegarLoop]: Abstraction has 31798 states and 116821 transitions. [2019-10-22 08:55:09,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 31798 states and 116821 transitions. [2019-10-22 08:55:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:55:09,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:09,488 INFO L380 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] [2019-10-22 08:55:09,488 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1856913635, now seen corresponding path program 1 times [2019-10-22 08:55:09,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542420239] [2019-10-22 08:55:09,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542420239] [2019-10-22 08:55:09,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:09,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:09,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095676951] [2019-10-22 08:55:09,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:09,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:09,577 INFO L87 Difference]: Start difference. First operand 31798 states and 116821 transitions. Second operand 5 states. [2019-10-22 08:55:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,117 INFO L93 Difference]: Finished difference Result 41646 states and 149745 transitions. [2019-10-22 08:55:10,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:10,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-22 08:55:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:10,269 INFO L225 Difference]: With dead ends: 41646 [2019-10-22 08:55:10,269 INFO L226 Difference]: Without dead ends: 41182 [2019-10-22 08:55:10,270 INFO L600 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-10-22 08:55:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41182 states. [2019-10-22 08:55:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41182 to 35366. [2019-10-22 08:55:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35366 states. [2019-10-22 08:55:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35366 states to 35366 states and 128879 transitions. [2019-10-22 08:55:11,753 INFO L78 Accepts]: Start accepts. Automaton has 35366 states and 128879 transitions. Word has length 50 [2019-10-22 08:55:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:11,756 INFO L462 AbstractCegarLoop]: Abstraction has 35366 states and 128879 transitions. [2019-10-22 08:55:11,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 35366 states and 128879 transitions. [2019-10-22 08:55:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 08:55:11,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:11,767 INFO L380 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-10-22 08:55:11,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1329818935, now seen corresponding path program 1 times [2019-10-22 08:55:11,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2754356] [2019-10-22 08:55:11,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:11,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2754356] [2019-10-22 08:55:11,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:11,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:11,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54370565] [2019-10-22 08:55:11,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:11,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:11,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:11,833 INFO L87 Difference]: Start difference. First operand 35366 states and 128879 transitions. Second operand 3 states. [2019-10-22 08:55:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:12,108 INFO L93 Difference]: Finished difference Result 45912 states and 163947 transitions. [2019-10-22 08:55:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:12,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-22 08:55:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:12,295 INFO L225 Difference]: With dead ends: 45912 [2019-10-22 08:55:12,295 INFO L226 Difference]: Without dead ends: 45912 [2019-10-22 08:55:12,295 INFO L600 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-10-22 08:55:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45912 states. [2019-10-22 08:55:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45912 to 40249. [2019-10-22 08:55:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40249 states. [2019-10-22 08:55:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40249 states to 40249 states and 145217 transitions. [2019-10-22 08:55:13,949 INFO L78 Accepts]: Start accepts. Automaton has 40249 states and 145217 transitions. Word has length 52 [2019-10-22 08:55:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:13,950 INFO L462 AbstractCegarLoop]: Abstraction has 40249 states and 145217 transitions. [2019-10-22 08:55:13,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 40249 states and 145217 transitions. [2019-10-22 08:55:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:55:13,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:13,969 INFO L380 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] [2019-10-22 08:55:13,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 865276026, now seen corresponding path program 1 times [2019-10-22 08:55:13,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488580800] [2019-10-22 08:55:13,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:14,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488580800] [2019-10-22 08:55:14,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:14,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:14,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049035477] [2019-10-22 08:55:14,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:14,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:14,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:14,097 INFO L87 Difference]: Start difference. First operand 40249 states and 145217 transitions. Second operand 6 states. [2019-10-22 08:55:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:14,926 INFO L93 Difference]: Finished difference Result 55268 states and 197194 transitions. [2019-10-22 08:55:14,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:14,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-22 08:55:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:15,177 INFO L225 Difference]: With dead ends: 55268 [2019-10-22 08:55:15,178 INFO L226 Difference]: Without dead ends: 54327 [2019-10-22 08:55:15,178 INFO L600 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-10-22 08:55:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54327 states. [2019-10-22 08:55:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54327 to 51013. [2019-10-22 08:55:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51013 states. [2019-10-22 08:55:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51013 states to 51013 states and 182732 transitions. [2019-10-22 08:55:16,888 INFO L78 Accepts]: Start accepts. Automaton has 51013 states and 182732 transitions. Word has length 56 [2019-10-22 08:55:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:16,888 INFO L462 AbstractCegarLoop]: Abstraction has 51013 states and 182732 transitions. [2019-10-22 08:55:16,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 51013 states and 182732 transitions. [2019-10-22 08:55:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:55:16,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:16,906 INFO L380 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] [2019-10-22 08:55:16,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -931675333, now seen corresponding path program 1 times [2019-10-22 08:55:16,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292881195] [2019-10-22 08:55:16,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:16,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-10-22 08:55:16,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292881195] [2019-10-22 08:55:16,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:16,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:16,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385875412] [2019-10-22 08:55:16,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:16,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:16,990 INFO L87 Difference]: Start difference. First operand 51013 states and 182732 transitions. Second operand 4 states. [2019-10-22 08:55:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:17,071 INFO L93 Difference]: Finished difference Result 13306 states and 41831 transitions. [2019-10-22 08:55:17,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:17,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-22 08:55:17,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:17,098 INFO L225 Difference]: With dead ends: 13306 [2019-10-22 08:55:17,098 INFO L226 Difference]: Without dead ends: 11955 [2019-10-22 08:55:17,098 INFO L600 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-10-22 08:55:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2019-10-22 08:55:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 11907. [2019-10-22 08:55:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11907 states. [2019-10-22 08:55:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11907 states to 11907 states and 37304 transitions. [2019-10-22 08:55:17,306 INFO L78 Accepts]: Start accepts. Automaton has 11907 states and 37304 transitions. Word has length 56 [2019-10-22 08:55:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:17,307 INFO L462 AbstractCegarLoop]: Abstraction has 11907 states and 37304 transitions. [2019-10-22 08:55:17,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 11907 states and 37304 transitions. [2019-10-22 08:55:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:55:17,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:17,311 INFO L380 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] [2019-10-22 08:55:17,311 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1629805932, now seen corresponding path program 1 times [2019-10-22 08:55:17,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:17,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832863178] [2019-10-22 08:55:17,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:17,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:17,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:17,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832863178] [2019-10-22 08:55:17,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:17,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:17,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189725192] [2019-10-22 08:55:17,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:17,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:17,399 INFO L87 Difference]: Start difference. First operand 11907 states and 37304 transitions. Second operand 6 states. [2019-10-22 08:55:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:17,780 INFO L93 Difference]: Finished difference Result 14683 states and 45392 transitions. [2019-10-22 08:55:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:17,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-22 08:55:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:17,811 INFO L225 Difference]: With dead ends: 14683 [2019-10-22 08:55:17,812 INFO L226 Difference]: Without dead ends: 14586 [2019-10-22 08:55:17,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14586 states. [2019-10-22 08:55:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14586 to 12115. [2019-10-22 08:55:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12115 states. [2019-10-22 08:55:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12115 states to 12115 states and 37960 transitions. [2019-10-22 08:55:18,055 INFO L78 Accepts]: Start accepts. Automaton has 12115 states and 37960 transitions. Word has length 56 [2019-10-22 08:55:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:18,056 INFO L462 AbstractCegarLoop]: Abstraction has 12115 states and 37960 transitions. [2019-10-22 08:55:18,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 12115 states and 37960 transitions. [2019-10-22 08:55:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:55:18,063 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:18,064 INFO L380 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-10-22 08:55:18,064 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:18,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:18,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1823345351, now seen corresponding path program 1 times [2019-10-22 08:55:18,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:18,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666778275] [2019-10-22 08:55:18,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:18,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:18,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666778275] [2019-10-22 08:55:18,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:18,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:18,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507651664] [2019-10-22 08:55:18,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:18,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:18,120 INFO L87 Difference]: Start difference. First operand 12115 states and 37960 transitions. Second operand 4 states. [2019-10-22 08:55:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:18,290 INFO L93 Difference]: Finished difference Result 14278 states and 44583 transitions. [2019-10-22 08:55:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:18,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-22 08:55:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:18,322 INFO L225 Difference]: With dead ends: 14278 [2019-10-22 08:55:18,322 INFO L226 Difference]: Without dead ends: 14278 [2019-10-22 08:55:18,323 INFO L600 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-10-22 08:55:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14278 states. [2019-10-22 08:55:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14278 to 12846. [2019-10-22 08:55:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12846 states. [2019-10-22 08:55:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12846 states to 12846 states and 40185 transitions. [2019-10-22 08:55:18,530 INFO L78 Accepts]: Start accepts. Automaton has 12846 states and 40185 transitions. Word has length 66 [2019-10-22 08:55:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:18,530 INFO L462 AbstractCegarLoop]: Abstraction has 12846 states and 40185 transitions. [2019-10-22 08:55:18,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 12846 states and 40185 transitions. [2019-10-22 08:55:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:55:18,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:18,537 INFO L380 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-10-22 08:55:18,537 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash -728811610, now seen corresponding path program 1 times [2019-10-22 08:55:18,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:18,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396749291] [2019-10-22 08:55:18,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:18,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:18,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396749291] [2019-10-22 08:55:18,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:18,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:18,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138504339] [2019-10-22 08:55:18,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:18,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:18,614 INFO L87 Difference]: Start difference. First operand 12846 states and 40185 transitions. Second operand 6 states. [2019-10-22 08:55:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:19,165 INFO L93 Difference]: Finished difference Result 16772 states and 51614 transitions. [2019-10-22 08:55:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:55:19,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-22 08:55:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:19,204 INFO L225 Difference]: With dead ends: 16772 [2019-10-22 08:55:19,204 INFO L226 Difference]: Without dead ends: 16708 [2019-10-22 08:55:19,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:55:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16708 states. [2019-10-22 08:55:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16708 to 13815. [2019-10-22 08:55:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13815 states. [2019-10-22 08:55:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13815 states to 13815 states and 42969 transitions. [2019-10-22 08:55:19,492 INFO L78 Accepts]: Start accepts. Automaton has 13815 states and 42969 transitions. Word has length 66 [2019-10-22 08:55:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:19,492 INFO L462 AbstractCegarLoop]: Abstraction has 13815 states and 42969 transitions. [2019-10-22 08:55:19,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13815 states and 42969 transitions. [2019-10-22 08:55:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 08:55:19,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:19,500 INFO L380 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] [2019-10-22 08:55:19,501 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash 846034892, now seen corresponding path program 1 times [2019-10-22 08:55:19,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:19,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994535091] [2019-10-22 08:55:19,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:19,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:19,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994535091] [2019-10-22 08:55:19,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:19,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:19,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096879765] [2019-10-22 08:55:19,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:19,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:19,551 INFO L87 Difference]: Start difference. First operand 13815 states and 42969 transitions. Second operand 4 states. [2019-10-22 08:55:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:19,790 INFO L93 Difference]: Finished difference Result 17362 states and 53258 transitions. [2019-10-22 08:55:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:19,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 08:55:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:19,819 INFO L225 Difference]: With dead ends: 17362 [2019-10-22 08:55:19,819 INFO L226 Difference]: Without dead ends: 17362 [2019-10-22 08:55:19,820 INFO L600 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-10-22 08:55:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17362 states. [2019-10-22 08:55:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17362 to 15786. [2019-10-22 08:55:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15786 states. [2019-10-22 08:55:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 48581 transitions. [2019-10-22 08:55:20,050 INFO L78 Accepts]: Start accepts. Automaton has 15786 states and 48581 transitions. Word has length 68 [2019-10-22 08:55:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:20,050 INFO L462 AbstractCegarLoop]: Abstraction has 15786 states and 48581 transitions. [2019-10-22 08:55:20,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15786 states and 48581 transitions. [2019-10-22 08:55:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 08:55:20,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:20,059 INFO L380 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] [2019-10-22 08:55:20,060 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1231174451, now seen corresponding path program 1 times [2019-10-22 08:55:20,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:20,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510695873] [2019-10-22 08:55:20,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:20,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:20,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510695873] [2019-10-22 08:55:20,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:20,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:20,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313102867] [2019-10-22 08:55:20,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:20,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:20,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:20,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:20,097 INFO L87 Difference]: Start difference. First operand 15786 states and 48581 transitions. Second operand 3 states. [2019-10-22 08:55:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:20,294 INFO L93 Difference]: Finished difference Result 16416 states and 50321 transitions. [2019-10-22 08:55:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:20,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-22 08:55:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:20,328 INFO L225 Difference]: With dead ends: 16416 [2019-10-22 08:55:20,328 INFO L226 Difference]: Without dead ends: 16416 [2019-10-22 08:55:20,328 INFO L600 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-10-22 08:55:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2019-10-22 08:55:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 16128. [2019-10-22 08:55:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16128 states. [2019-10-22 08:55:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16128 states to 16128 states and 49519 transitions. [2019-10-22 08:55:20,596 INFO L78 Accepts]: Start accepts. Automaton has 16128 states and 49519 transitions. Word has length 68 [2019-10-22 08:55:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:20,596 INFO L462 AbstractCegarLoop]: Abstraction has 16128 states and 49519 transitions. [2019-10-22 08:55:20,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16128 states and 49519 transitions. [2019-10-22 08:55:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:55:20,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:20,606 INFO L380 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] [2019-10-22 08:55:20,606 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1793539720, now seen corresponding path program 1 times [2019-10-22 08:55:20,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:20,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901068393] [2019-10-22 08:55:20,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:20,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:20,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901068393] [2019-10-22 08:55:20,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:20,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:20,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408707844] [2019-10-22 08:55:20,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:20,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:20,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:20,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:20,701 INFO L87 Difference]: Start difference. First operand 16128 states and 49519 transitions. Second operand 6 states. [2019-10-22 08:55:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:21,159 INFO L93 Difference]: Finished difference Result 17580 states and 53338 transitions. [2019-10-22 08:55:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:21,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-22 08:55:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:21,196 INFO L225 Difference]: With dead ends: 17580 [2019-10-22 08:55:21,196 INFO L226 Difference]: Without dead ends: 17580 [2019-10-22 08:55:21,196 INFO L600 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-10-22 08:55:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-10-22 08:55:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 17011. [2019-10-22 08:55:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17011 states. [2019-10-22 08:55:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 51785 transitions. [2019-10-22 08:55:21,411 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 51785 transitions. Word has length 70 [2019-10-22 08:55:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:21,411 INFO L462 AbstractCegarLoop]: Abstraction has 17011 states and 51785 transitions. [2019-10-22 08:55:21,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 51785 transitions. [2019-10-22 08:55:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:55:21,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:21,419 INFO L380 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] [2019-10-22 08:55:21,419 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 424218233, now seen corresponding path program 1 times [2019-10-22 08:55:21,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:21,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693986027] [2019-10-22 08:55:21,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:21,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:21,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:21,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693986027] [2019-10-22 08:55:21,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:21,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:21,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905240281] [2019-10-22 08:55:21,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:21,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:21,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:21,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:21,505 INFO L87 Difference]: Start difference. First operand 17011 states and 51785 transitions. Second operand 6 states. [2019-10-22 08:55:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:21,925 INFO L93 Difference]: Finished difference Result 19876 states and 58895 transitions. [2019-10-22 08:55:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:21,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-22 08:55:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:21,953 INFO L225 Difference]: With dead ends: 19876 [2019-10-22 08:55:21,953 INFO L226 Difference]: Without dead ends: 19876 [2019-10-22 08:55:21,953 INFO L600 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-10-22 08:55:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19876 states. [2019-10-22 08:55:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19876 to 17687. [2019-10-22 08:55:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17687 states. [2019-10-22 08:55:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17687 states to 17687 states and 52851 transitions. [2019-10-22 08:55:22,173 INFO L78 Accepts]: Start accepts. Automaton has 17687 states and 52851 transitions. Word has length 70 [2019-10-22 08:55:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:22,173 INFO L462 AbstractCegarLoop]: Abstraction has 17687 states and 52851 transitions. [2019-10-22 08:55:22,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 17687 states and 52851 transitions. [2019-10-22 08:55:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:55:22,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:22,184 INFO L380 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] [2019-10-22 08:55:22,184 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash 635569146, now seen corresponding path program 1 times [2019-10-22 08:55:22,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:22,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122986777] [2019-10-22 08:55:22,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:22,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122986777] [2019-10-22 08:55:22,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:22,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:22,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905761838] [2019-10-22 08:55:22,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:22,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:22,248 INFO L87 Difference]: Start difference. First operand 17687 states and 52851 transitions. Second operand 5 states. [2019-10-22 08:55:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:22,542 INFO L93 Difference]: Finished difference Result 22461 states and 66799 transitions. [2019-10-22 08:55:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:22,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-22 08:55:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:22,575 INFO L225 Difference]: With dead ends: 22461 [2019-10-22 08:55:22,575 INFO L226 Difference]: Without dead ends: 22461 [2019-10-22 08:55:22,575 INFO L600 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-10-22 08:55:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22461 states. [2019-10-22 08:55:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22461 to 18981. [2019-10-22 08:55:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18981 states. [2019-10-22 08:55:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18981 states to 18981 states and 56247 transitions. [2019-10-22 08:55:22,828 INFO L78 Accepts]: Start accepts. Automaton has 18981 states and 56247 transitions. Word has length 70 [2019-10-22 08:55:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:22,828 INFO L462 AbstractCegarLoop]: Abstraction has 18981 states and 56247 transitions. [2019-10-22 08:55:22,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 18981 states and 56247 transitions. [2019-10-22 08:55:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:55:22,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:22,840 INFO L380 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] [2019-10-22 08:55:22,840 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash 125034969, now seen corresponding path program 1 times [2019-10-22 08:55:22,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:22,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121732038] [2019-10-22 08:55:22,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:22,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121732038] [2019-10-22 08:55:22,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:22,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:22,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300493074] [2019-10-22 08:55:22,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:22,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:22,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:22,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:22,900 INFO L87 Difference]: Start difference. First operand 18981 states and 56247 transitions. Second operand 5 states. [2019-10-22 08:55:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,275 INFO L93 Difference]: Finished difference Result 25575 states and 75567 transitions. [2019-10-22 08:55:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:23,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-22 08:55:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,314 INFO L225 Difference]: With dead ends: 25575 [2019-10-22 08:55:23,315 INFO L226 Difference]: Without dead ends: 25575 [2019-10-22 08:55:23,315 INFO L600 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-10-22 08:55:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25575 states. [2019-10-22 08:55:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25575 to 20147. [2019-10-22 08:55:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20147 states. [2019-10-22 08:55:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20147 states to 20147 states and 59691 transitions. [2019-10-22 08:55:23,607 INFO L78 Accepts]: Start accepts. Automaton has 20147 states and 59691 transitions. Word has length 70 [2019-10-22 08:55:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,607 INFO L462 AbstractCegarLoop]: Abstraction has 20147 states and 59691 transitions. [2019-10-22 08:55:23,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20147 states and 59691 transitions. [2019-10-22 08:55:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:55:23,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,619 INFO L380 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] [2019-10-22 08:55:23,619 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1682419494, now seen corresponding path program 1 times [2019-10-22 08:55:23,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746662680] [2019-10-22 08:55:23,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:23,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746662680] [2019-10-22 08:55:23,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:23,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:23,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936799291] [2019-10-22 08:55:23,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:23,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:23,694 INFO L87 Difference]: Start difference. First operand 20147 states and 59691 transitions. Second operand 4 states. [2019-10-22 08:55:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,075 INFO L93 Difference]: Finished difference Result 26775 states and 79462 transitions. [2019-10-22 08:55:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:24,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-22 08:55:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,121 INFO L225 Difference]: With dead ends: 26775 [2019-10-22 08:55:24,121 INFO L226 Difference]: Without dead ends: 26395 [2019-10-22 08:55:24,122 INFO L600 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-10-22 08:55:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-10-22 08:55:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 24451. [2019-10-22 08:55:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24451 states. [2019-10-22 08:55:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24451 states to 24451 states and 72603 transitions. [2019-10-22 08:55:24,462 INFO L78 Accepts]: Start accepts. Automaton has 24451 states and 72603 transitions. Word has length 70 [2019-10-22 08:55:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,462 INFO L462 AbstractCegarLoop]: Abstraction has 24451 states and 72603 transitions. [2019-10-22 08:55:24,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24451 states and 72603 transitions. [2019-10-22 08:55:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:55:24,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,479 INFO L380 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] [2019-10-22 08:55:24,479 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash 815596443, now seen corresponding path program 1 times [2019-10-22 08:55:24,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746792382] [2019-10-22 08:55:24,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:24,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746792382] [2019-10-22 08:55:24,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:24,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684108803] [2019-10-22 08:55:24,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:24,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:24,556 INFO L87 Difference]: Start difference. First operand 24451 states and 72603 transitions. Second operand 5 states. [2019-10-22 08:55:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,618 INFO L93 Difference]: Finished difference Result 6907 states and 16565 transitions. [2019-10-22 08:55:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:24,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-22 08:55:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,627 INFO L225 Difference]: With dead ends: 6907 [2019-10-22 08:55:24,627 INFO L226 Difference]: Without dead ends: 5463 [2019-10-22 08:55:24,628 INFO L600 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-10-22 08:55:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-10-22 08:55:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 4793. [2019-10-22 08:55:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4793 states. [2019-10-22 08:55:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 11261 transitions. [2019-10-22 08:55:24,701 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 11261 transitions. Word has length 70 [2019-10-22 08:55:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,701 INFO L462 AbstractCegarLoop]: Abstraction has 4793 states and 11261 transitions. [2019-10-22 08:55:24,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 11261 transitions. [2019-10-22 08:55:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 08:55:24,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,706 INFO L380 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, 1, 1] [2019-10-22 08:55:24,707 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2135127135, now seen corresponding path program 1 times [2019-10-22 08:55:24,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632413740] [2019-10-22 08:55:24,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:24,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632413740] [2019-10-22 08:55:24,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:24,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713229271] [2019-10-22 08:55:24,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:55:24,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:24,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:24,782 INFO L87 Difference]: Start difference. First operand 4793 states and 11261 transitions. Second operand 5 states. [2019-10-22 08:55:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,988 INFO L93 Difference]: Finished difference Result 5634 states and 13087 transitions. [2019-10-22 08:55:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:24,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-22 08:55:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,994 INFO L225 Difference]: With dead ends: 5634 [2019-10-22 08:55:24,994 INFO L226 Difference]: Without dead ends: 5600 [2019-10-22 08:55:24,994 INFO L600 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-10-22 08:55:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2019-10-22 08:55:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 4946. [2019-10-22 08:55:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4946 states. [2019-10-22 08:55:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4946 states to 4946 states and 11562 transitions. [2019-10-22 08:55:25,058 INFO L78 Accepts]: Start accepts. Automaton has 4946 states and 11562 transitions. Word has length 85 [2019-10-22 08:55:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,058 INFO L462 AbstractCegarLoop]: Abstraction has 4946 states and 11562 transitions. [2019-10-22 08:55:25,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:55:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4946 states and 11562 transitions. [2019-10-22 08:55:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 08:55:25,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,064 INFO L380 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, 1, 1] [2019-10-22 08:55:25,064 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash 970814065, now seen corresponding path program 2 times [2019-10-22 08:55:25,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936516956] [2019-10-22 08:55:25,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:25,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936516956] [2019-10-22 08:55:25,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:25,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900035298] [2019-10-22 08:55:25,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:25,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:25,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:25,170 INFO L87 Difference]: Start difference. First operand 4946 states and 11562 transitions. Second operand 6 states. [2019-10-22 08:55:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,222 INFO L93 Difference]: Finished difference Result 4690 states and 10746 transitions. [2019-10-22 08:55:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:25,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-22 08:55:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,229 INFO L225 Difference]: With dead ends: 4690 [2019-10-22 08:55:25,229 INFO L226 Difference]: Without dead ends: 4690 [2019-10-22 08:55:25,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2019-10-22 08:55:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 3139. [2019-10-22 08:55:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2019-10-22 08:55:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 7238 transitions. [2019-10-22 08:55:25,282 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 7238 transitions. Word has length 85 [2019-10-22 08:55:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,282 INFO L462 AbstractCegarLoop]: Abstraction has 3139 states and 7238 transitions. [2019-10-22 08:55:25,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 7238 transitions. [2019-10-22 08:55:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:55:25,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,313 INFO L380 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, 1, 1, 1, 1] [2019-10-22 08:55:25,314 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1967896785, now seen corresponding path program 1 times [2019-10-22 08:55:25,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799127429] [2019-10-22 08:55:25,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:25,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799127429] [2019-10-22 08:55:25,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:25,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527875041] [2019-10-22 08:55:25,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:25,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:25,401 INFO L87 Difference]: Start difference. First operand 3139 states and 7238 transitions. Second operand 6 states. [2019-10-22 08:55:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,592 INFO L93 Difference]: Finished difference Result 3276 states and 7512 transitions. [2019-10-22 08:55:25,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:25,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-22 08:55:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,597 INFO L225 Difference]: With dead ends: 3276 [2019-10-22 08:55:25,597 INFO L226 Difference]: Without dead ends: 3276 [2019-10-22 08:55:25,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-10-22 08:55:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3080. [2019-10-22 08:55:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-10-22 08:55:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 7095 transitions. [2019-10-22 08:55:25,626 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 7095 transitions. Word has length 87 [2019-10-22 08:55:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,627 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 7095 transitions. [2019-10-22 08:55:25,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 7095 transitions. [2019-10-22 08:55:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:55:25,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,630 INFO L380 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, 1, 1, 1, 1] [2019-10-22 08:55:25,630 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1431028912, now seen corresponding path program 1 times [2019-10-22 08:55:25,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342166966] [2019-10-22 08:55:25,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:25,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342166966] [2019-10-22 08:55:25,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:55:25,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63546908] [2019-10-22 08:55:25,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:55:25,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:25,733 INFO L87 Difference]: Start difference. First operand 3080 states and 7095 transitions. Second operand 10 states. [2019-10-22 08:55:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:26,081 INFO L93 Difference]: Finished difference Result 8221 states and 19178 transitions. [2019-10-22 08:55:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:55:26,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-10-22 08:55:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:26,086 INFO L225 Difference]: With dead ends: 8221 [2019-10-22 08:55:26,086 INFO L226 Difference]: Without dead ends: 5497 [2019-10-22 08:55:26,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:55:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2019-10-22 08:55:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 3270. [2019-10-22 08:55:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2019-10-22 08:55:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 7499 transitions. [2019-10-22 08:55:26,131 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 7499 transitions. Word has length 87 [2019-10-22 08:55:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:26,131 INFO L462 AbstractCegarLoop]: Abstraction has 3270 states and 7499 transitions. [2019-10-22 08:55:26,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:55:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 7499 transitions. [2019-10-22 08:55:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:55:26,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:26,134 INFO L380 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, 1, 1, 1, 1] [2019-10-22 08:55:26,135 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 430930678, now seen corresponding path program 2 times [2019-10-22 08:55:26,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:26,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662996350] [2019-10-22 08:55:26,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:26,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:26,205 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:55:26,330 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 08:55:26,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:26 BasicIcfg [2019-10-22 08:55:26,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:26,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:26,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:26,338 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:26,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:01" (3/4) ... [2019-10-22 08:55:26,341 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:55:26,467 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0dc912b1-0a2e-4b25-a336-58f6de203c24/bin/uautomizer/witness.graphml [2019-10-22 08:55:26,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:26,472 INFO L168 Benchmark]: Toolchain (without parser) took 25899.24 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 939.1 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 701.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:26,472 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:26,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:26,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:26,473 INFO L168 Benchmark]: Boogie Preprocessor took 29.74 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-10-22 08:55:26,473 INFO L168 Benchmark]: RCFGBuilder took 631.96 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:26,473 INFO L168 Benchmark]: TraceAbstraction took 24355.71 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 637.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:26,474 INFO L168 Benchmark]: Witness Printer took 132.81 ms. Allocated memory is still 2.9 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:26,475 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 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.74 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 631.96 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24355.71 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 637.1 MB. Max. memory is 11.5 GB. * Witness Printer took 132.81 ms. Allocated memory is still 2.9 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 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] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. Result: UNSAFE, OverallTime: 24.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5904 SDtfs, 6044 SDslu, 13005 SDs, 0 SdLazy, 4015 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51013occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 44215 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 200134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...