./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.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/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/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 fa041608809d444b2c1f56abe61099842d8954f6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-15 23:36:52,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:36:52,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:36:52,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:36:52,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:36:52,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:36:52,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:36:52,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:36:52,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:36:52,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:36:52,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:36:52,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:36:52,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:36:52,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:36:52,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:36:52,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:36:52,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:36:52,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:36:52,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:36:52,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:36:52,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:36:52,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:36:52,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:36:52,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:36:52,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:36:52,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:36:52,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:36:52,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:36:52,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:36:52,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:36:52,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:36:52,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:36:52,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:36:52,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:36:52,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:36:52,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:36:52,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:36:52,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:36:52,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:36:52,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:36:52,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:36:52,392 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:36:52,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:36:52,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:36:52,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:36:52,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:36:52,421 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:36:52,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:36:52,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:36:52,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:36:52,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:36:52,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:36:52,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:36:52,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:36:52,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:36:52,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:36:52,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:36:52,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:36:52,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:36:52,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:36:52,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:36:52,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:36:52,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:36:52,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:36:52,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:36:52,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:36:52,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:36:52,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:36:52,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:36:52,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:36:52,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/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 -> fa041608809d444b2c1f56abe61099842d8954f6 [2019-11-15 23:36:52,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:36:52,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:36:52,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:36:52,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:36:52,486 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:36:52,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_pso.opt.i [2019-11-15 23:36:52,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/data/e87b04ab5/4fcf7f28e79d4a6aafd0d04b7fb9d484/FLAG9ac82b217 [2019-11-15 23:36:53,049 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:36:53,050 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/sv-benchmarks/c/pthread-wmm/rfi000_pso.opt.i [2019-11-15 23:36:53,068 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/data/e87b04ab5/4fcf7f28e79d4a6aafd0d04b7fb9d484/FLAG9ac82b217 [2019-11-15 23:36:53,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/data/e87b04ab5/4fcf7f28e79d4a6aafd0d04b7fb9d484 [2019-11-15 23:36:53,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:36:53,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:36:53,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:53,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:36:53,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:36:53,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:53" (1/1) ... [2019-11-15 23:36:53,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7d5d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:53, skipping insertion in model container [2019-11-15 23:36:53,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:53" (1/1) ... [2019-11-15 23:36:53,373 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:36:53,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:36:54,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:54,012 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:36:54,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:54,154 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:36:54,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54 WrapperNode [2019-11-15 23:36:54,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:54,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:54,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:36:54,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:36:54,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:54,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:36:54,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:36:54,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:36:54,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... [2019-11-15 23:36:54,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:36:54,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:36:54,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:36:54,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:36:54,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:36:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:36:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:36:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:36:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:36:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:36:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:36:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:36:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:36:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:36:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:36:54,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:36:54,352 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:36:55,015 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:36:55,015 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:36:55,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:55 BoogieIcfgContainer [2019-11-15 23:36:55,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:36:55,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:36:55,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:36:55,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:36:55,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:36:53" (1/3) ... [2019-11-15 23:36:55,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b00311a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:55, skipping insertion in model container [2019-11-15 23:36:55,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:54" (2/3) ... [2019-11-15 23:36:55,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b00311a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:55, skipping insertion in model container [2019-11-15 23:36:55,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:55" (3/3) ... [2019-11-15 23:36:55,023 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-11-15 23:36:55,058 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,059 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,059 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,059 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,059 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,060 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,060 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,060 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,060 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,060 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,061 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,062 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,063 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,064 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,065 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,066 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,066 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,066 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,066 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,066 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:36:55,077 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:36:55,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:36:55,085 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:36:55,096 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:36:55,112 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:36:55,112 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:36:55,112 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:36:55,113 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:36:55,113 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:36:55,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:36:55,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:36:55,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:36:55,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 23:36:57,037 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22494 states. [2019-11-15 23:36:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 22494 states. [2019-11-15 23:36:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:36:57,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:57,053 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] [2019-11-15 23:36:57,057 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 583556461, now seen corresponding path program 1 times [2019-11-15 23:36:57,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:57,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647902434] [2019-11-15 23:36:57,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:57,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647902434] [2019-11-15 23:36:57,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:57,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:36:57,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577689861] [2019-11-15 23:36:57,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:36:57,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:36:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:36:57,481 INFO L87 Difference]: Start difference. First operand 22494 states. Second operand 4 states. [2019-11-15 23:36:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:36:58,186 INFO L93 Difference]: Finished difference Result 23446 states and 91747 transitions. [2019-11-15 23:36:58,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:36:58,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 23:36:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:36:58,444 INFO L225 Difference]: With dead ends: 23446 [2019-11-15 23:36:58,444 INFO L226 Difference]: Without dead ends: 21270 [2019-11-15 23:36:58,447 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-11-15 23:36:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21270 states. [2019-11-15 23:36:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21270 to 21270. [2019-11-15 23:36:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21270 states. [2019-11-15 23:36:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21270 states to 21270 states and 83771 transitions. [2019-11-15 23:36:59,696 INFO L78 Accepts]: Start accepts. Automaton has 21270 states and 83771 transitions. Word has length 37 [2019-11-15 23:36:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:36:59,698 INFO L462 AbstractCegarLoop]: Abstraction has 21270 states and 83771 transitions. [2019-11-15 23:36:59,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:36:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21270 states and 83771 transitions. [2019-11-15 23:36:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:36:59,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:36:59,710 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] [2019-11-15 23:36:59,710 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:36:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash -189509872, now seen corresponding path program 1 times [2019-11-15 23:36:59,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:59,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110699190] [2019-11-15 23:36:59,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:59,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:59,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:59,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110699190] [2019-11-15 23:36:59,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:36:59,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:36:59,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886191469] [2019-11-15 23:36:59,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:36:59,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:36:59,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:36:59,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:36:59,828 INFO L87 Difference]: Start difference. First operand 21270 states and 83771 transitions. Second operand 5 states. [2019-11-15 23:37:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:01,014 INFO L93 Difference]: Finished difference Result 34704 states and 129063 transitions. [2019-11-15 23:37:01,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:01,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 23:37:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:01,164 INFO L225 Difference]: With dead ends: 34704 [2019-11-15 23:37:01,164 INFO L226 Difference]: Without dead ends: 34560 [2019-11-15 23:37:01,165 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-11-15 23:37:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34560 states. [2019-11-15 23:37:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34560 to 33060. [2019-11-15 23:37:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33060 states. [2019-11-15 23:37:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33060 states to 33060 states and 123951 transitions. [2019-11-15 23:37:02,595 INFO L78 Accepts]: Start accepts. Automaton has 33060 states and 123951 transitions. Word has length 44 [2019-11-15 23:37:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:02,598 INFO L462 AbstractCegarLoop]: Abstraction has 33060 states and 123951 transitions. [2019-11-15 23:37:02,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33060 states and 123951 transitions. [2019-11-15 23:37:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:37:02,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:02,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] [2019-11-15 23:37:02,607 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 613942952, now seen corresponding path program 1 times [2019-11-15 23:37:02,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:02,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163397495] [2019-11-15 23:37:02,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:02,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:02,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:02,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163397495] [2019-11-15 23:37:02,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:02,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:02,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606020336] [2019-11-15 23:37:02,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:02,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:02,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:02,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:02,746 INFO L87 Difference]: Start difference. First operand 33060 states and 123951 transitions. Second operand 5 states. [2019-11-15 23:37:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:03,886 INFO L93 Difference]: Finished difference Result 40212 states and 148620 transitions. [2019-11-15 23:37:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:03,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:37:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:04,066 INFO L225 Difference]: With dead ends: 40212 [2019-11-15 23:37:04,066 INFO L226 Difference]: Without dead ends: 40052 [2019-11-15 23:37:04,067 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-11-15 23:37:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40052 states. [2019-11-15 23:37:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40052 to 34633. [2019-11-15 23:37:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34633 states. [2019-11-15 23:37:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34633 states to 34633 states and 129247 transitions. [2019-11-15 23:37:05,105 INFO L78 Accepts]: Start accepts. Automaton has 34633 states and 129247 transitions. Word has length 45 [2019-11-15 23:37:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:05,106 INFO L462 AbstractCegarLoop]: Abstraction has 34633 states and 129247 transitions. [2019-11-15 23:37:05,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34633 states and 129247 transitions. [2019-11-15 23:37:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:37:05,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:05,592 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-11-15 23:37:05,592 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash -321216049, now seen corresponding path program 1 times [2019-11-15 23:37:05,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:05,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797859448] [2019-11-15 23:37:05,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:05,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:05,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:05,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797859448] [2019-11-15 23:37:05,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:05,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:05,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672624923] [2019-11-15 23:37:05,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:05,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:05,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:05,734 INFO L87 Difference]: Start difference. First operand 34633 states and 129247 transitions. Second operand 6 states. [2019-11-15 23:37:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:06,781 INFO L93 Difference]: Finished difference Result 45661 states and 166141 transitions. [2019-11-15 23:37:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:37:06,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 23:37:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:06,978 INFO L225 Difference]: With dead ends: 45661 [2019-11-15 23:37:06,978 INFO L226 Difference]: Without dead ends: 45517 [2019-11-15 23:37:06,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:37:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45517 states. [2019-11-15 23:37:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45517 to 33596. [2019-11-15 23:37:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33596 states. [2019-11-15 23:37:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33596 states to 33596 states and 125402 transitions. [2019-11-15 23:37:08,010 INFO L78 Accepts]: Start accepts. Automaton has 33596 states and 125402 transitions. Word has length 52 [2019-11-15 23:37:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:08,011 INFO L462 AbstractCegarLoop]: Abstraction has 33596 states and 125402 transitions. [2019-11-15 23:37:08,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33596 states and 125402 transitions. [2019-11-15 23:37:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:37:08,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:08,042 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] [2019-11-15 23:37:08,043 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:08,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:08,044 INFO L82 PathProgramCache]: Analyzing trace with hash -469025415, now seen corresponding path program 1 times [2019-11-15 23:37:08,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:08,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676174992] [2019-11-15 23:37:08,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:08,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:08,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:08,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676174992] [2019-11-15 23:37:08,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:08,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:08,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521963261] [2019-11-15 23:37:08,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:08,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:08,177 INFO L87 Difference]: Start difference. First operand 33596 states and 125402 transitions. Second operand 6 states. [2019-11-15 23:37:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:09,381 INFO L93 Difference]: Finished difference Result 46068 states and 167835 transitions. [2019-11-15 23:37:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:37:09,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-15 23:37:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:09,506 INFO L225 Difference]: With dead ends: 46068 [2019-11-15 23:37:09,507 INFO L226 Difference]: Without dead ends: 45828 [2019-11-15 23:37:09,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:37:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45828 states. [2019-11-15 23:37:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45828 to 39957. [2019-11-15 23:37:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39957 states. [2019-11-15 23:37:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39957 states to 39957 states and 147326 transitions. [2019-11-15 23:37:10,567 INFO L78 Accepts]: Start accepts. Automaton has 39957 states and 147326 transitions. Word has length 59 [2019-11-15 23:37:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:10,568 INFO L462 AbstractCegarLoop]: Abstraction has 39957 states and 147326 transitions. [2019-11-15 23:37:10,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 39957 states and 147326 transitions. [2019-11-15 23:37:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:37:10,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:10,648 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] [2019-11-15 23:37:10,648 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1354902346, now seen corresponding path program 1 times [2019-11-15 23:37:10,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:10,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499328351] [2019-11-15 23:37:10,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:10,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:10,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:10,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499328351] [2019-11-15 23:37:10,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:10,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:10,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678305412] [2019-11-15 23:37:10,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:10,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:10,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:10,726 INFO L87 Difference]: Start difference. First operand 39957 states and 147326 transitions. Second operand 3 states. [2019-11-15 23:37:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:10,962 INFO L93 Difference]: Finished difference Result 50255 states and 182161 transitions. [2019-11-15 23:37:10,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:10,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-15 23:37:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:11,068 INFO L225 Difference]: With dead ends: 50255 [2019-11-15 23:37:11,068 INFO L226 Difference]: Without dead ends: 50255 [2019-11-15 23:37:11,068 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-11-15 23:37:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50255 states. [2019-11-15 23:37:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50255 to 43887. [2019-11-15 23:37:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43887 states. [2019-11-15 23:37:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43887 states to 43887 states and 160764 transitions. [2019-11-15 23:37:12,340 INFO L78 Accepts]: Start accepts. Automaton has 43887 states and 160764 transitions. Word has length 61 [2019-11-15 23:37:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:12,340 INFO L462 AbstractCegarLoop]: Abstraction has 43887 states and 160764 transitions. [2019-11-15 23:37:12,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 43887 states and 160764 transitions. [2019-11-15 23:37:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:37:12,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:12,389 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] [2019-11-15 23:37:12,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1019283348, now seen corresponding path program 1 times [2019-11-15 23:37:12,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:12,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482159175] [2019-11-15 23:37:12,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:12,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:12,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:12,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482159175] [2019-11-15 23:37:12,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:12,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:37:12,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653851234] [2019-11-15 23:37:12,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:12,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:12,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:12,500 INFO L87 Difference]: Start difference. First operand 43887 states and 160764 transitions. Second operand 7 states. [2019-11-15 23:37:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:13,507 INFO L93 Difference]: Finished difference Result 55883 states and 200498 transitions. [2019-11-15 23:37:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:37:13,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 23:37:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:13,619 INFO L225 Difference]: With dead ends: 55883 [2019-11-15 23:37:13,620 INFO L226 Difference]: Without dead ends: 55643 [2019-11-15 23:37:13,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:37:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55643 states. [2019-11-15 23:37:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55643 to 45113. [2019-11-15 23:37:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45113 states. [2019-11-15 23:37:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45113 states to 45113 states and 164931 transitions. [2019-11-15 23:37:15,107 INFO L78 Accepts]: Start accepts. Automaton has 45113 states and 164931 transitions. Word has length 65 [2019-11-15 23:37:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:15,108 INFO L462 AbstractCegarLoop]: Abstraction has 45113 states and 164931 transitions. [2019-11-15 23:37:15,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 45113 states and 164931 transitions. [2019-11-15 23:37:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:37:15,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:15,148 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-11-15 23:37:15,148 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1701853088, now seen corresponding path program 1 times [2019-11-15 23:37:15,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:15,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586113986] [2019-11-15 23:37:15,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:15,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586113986] [2019-11-15 23:37:15,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:15,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:37:15,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276288702] [2019-11-15 23:37:15,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:15,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:15,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:15,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:15,256 INFO L87 Difference]: Start difference. First operand 45113 states and 164931 transitions. Second operand 7 states. [2019-11-15 23:37:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:16,326 INFO L93 Difference]: Finished difference Result 55097 states and 197675 transitions. [2019-11-15 23:37:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:37:16,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-15 23:37:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:16,449 INFO L225 Difference]: With dead ends: 55097 [2019-11-15 23:37:16,449 INFO L226 Difference]: Without dead ends: 54897 [2019-11-15 23:37:16,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:37:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54897 states. [2019-11-15 23:37:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54897 to 45991. [2019-11-15 23:37:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45991 states. [2019-11-15 23:37:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45991 states to 45991 states and 167802 transitions. [2019-11-15 23:37:17,443 INFO L78 Accepts]: Start accepts. Automaton has 45991 states and 167802 transitions. Word has length 66 [2019-11-15 23:37:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:17,443 INFO L462 AbstractCegarLoop]: Abstraction has 45991 states and 167802 transitions. [2019-11-15 23:37:17,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 45991 states and 167802 transitions. [2019-11-15 23:37:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:37:17,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:17,477 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-11-15 23:37:17,477 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1329095655, now seen corresponding path program 1 times [2019-11-15 23:37:17,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:17,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476748832] [2019-11-15 23:37:17,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:17,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:17,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:17,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476748832] [2019-11-15 23:37:17,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:17,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:17,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838220335] [2019-11-15 23:37:17,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:17,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:17,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:17,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:17,633 INFO L87 Difference]: Start difference. First operand 45991 states and 167802 transitions. Second operand 6 states. [2019-11-15 23:37:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:18,932 INFO L93 Difference]: Finished difference Result 65551 states and 237329 transitions. [2019-11-15 23:37:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:18,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:37:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:19,081 INFO L225 Difference]: With dead ends: 65551 [2019-11-15 23:37:19,082 INFO L226 Difference]: Without dead ends: 64907 [2019-11-15 23:37:19,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:37:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64907 states. [2019-11-15 23:37:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64907 to 56041. [2019-11-15 23:37:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56041 states. [2019-11-15 23:37:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56041 states to 56041 states and 204332 transitions. [2019-11-15 23:37:20,240 INFO L78 Accepts]: Start accepts. Automaton has 56041 states and 204332 transitions. Word has length 68 [2019-11-15 23:37:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:20,240 INFO L462 AbstractCegarLoop]: Abstraction has 56041 states and 204332 transitions. [2019-11-15 23:37:20,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 56041 states and 204332 transitions. [2019-11-15 23:37:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:37:20,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:20,289 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-11-15 23:37:20,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2004257624, now seen corresponding path program 1 times [2019-11-15 23:37:20,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:20,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268986712] [2019-11-15 23:37:20,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:20,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:20,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:20,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268986712] [2019-11-15 23:37:20,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:20,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:37:20,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151143273] [2019-11-15 23:37:20,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:20,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:20,412 INFO L87 Difference]: Start difference. First operand 56041 states and 204332 transitions. Second operand 7 states. [2019-11-15 23:37:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:21,473 INFO L93 Difference]: Finished difference Result 83029 states and 292760 transitions. [2019-11-15 23:37:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:37:21,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-11-15 23:37:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:21,645 INFO L225 Difference]: With dead ends: 83029 [2019-11-15 23:37:21,645 INFO L226 Difference]: Without dead ends: 83029 [2019-11-15 23:37:21,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:37:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83029 states. [2019-11-15 23:37:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83029 to 76078. [2019-11-15 23:37:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76078 states. [2019-11-15 23:37:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76078 states to 76078 states and 270627 transitions. [2019-11-15 23:37:23,781 INFO L78 Accepts]: Start accepts. Automaton has 76078 states and 270627 transitions. Word has length 68 [2019-11-15 23:37:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:23,781 INFO L462 AbstractCegarLoop]: Abstraction has 76078 states and 270627 transitions. [2019-11-15 23:37:23,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 76078 states and 270627 transitions. [2019-11-15 23:37:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:37:23,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:23,848 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-11-15 23:37:23,848 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash -759493143, now seen corresponding path program 1 times [2019-11-15 23:37:23,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:23,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230349503] [2019-11-15 23:37:23,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:23,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:23,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:23,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230349503] [2019-11-15 23:37:23,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:23,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:23,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070710204] [2019-11-15 23:37:23,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:23,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:23,913 INFO L87 Difference]: Start difference. First operand 76078 states and 270627 transitions. Second operand 3 states. [2019-11-15 23:37:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:24,172 INFO L93 Difference]: Finished difference Result 54414 states and 197408 transitions. [2019-11-15 23:37:24,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:24,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 23:37:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:24,293 INFO L225 Difference]: With dead ends: 54414 [2019-11-15 23:37:24,293 INFO L226 Difference]: Without dead ends: 54252 [2019-11-15 23:37:24,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54252 states. [2019-11-15 23:37:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54252 to 54212. [2019-11-15 23:37:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54212 states. [2019-11-15 23:37:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54212 states to 54212 states and 196823 transitions. [2019-11-15 23:37:25,289 INFO L78 Accepts]: Start accepts. Automaton has 54212 states and 196823 transitions. Word has length 68 [2019-11-15 23:37:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:25,289 INFO L462 AbstractCegarLoop]: Abstraction has 54212 states and 196823 transitions. [2019-11-15 23:37:25,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 54212 states and 196823 transitions. [2019-11-15 23:37:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:37:25,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:25,328 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] [2019-11-15 23:37:25,328 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1811531678, now seen corresponding path program 1 times [2019-11-15 23:37:25,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:25,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470452580] [2019-11-15 23:37:25,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:25,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:25,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:25,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470452580] [2019-11-15 23:37:25,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:25,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:25,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652926202] [2019-11-15 23:37:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:25,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:25,434 INFO L87 Difference]: Start difference. First operand 54212 states and 196823 transitions. Second operand 5 states. [2019-11-15 23:37:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:26,147 INFO L93 Difference]: Finished difference Result 84427 states and 303655 transitions. [2019-11-15 23:37:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:37:26,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 23:37:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:26,328 INFO L225 Difference]: With dead ends: 84427 [2019-11-15 23:37:26,329 INFO L226 Difference]: Without dead ends: 84231 [2019-11-15 23:37:26,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84231 states. [2019-11-15 23:37:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84231 to 76146. [2019-11-15 23:37:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76146 states. [2019-11-15 23:37:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76146 states to 76146 states and 275543 transitions. [2019-11-15 23:37:31,311 INFO L78 Accepts]: Start accepts. Automaton has 76146 states and 275543 transitions. Word has length 69 [2019-11-15 23:37:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:31,311 INFO L462 AbstractCegarLoop]: Abstraction has 76146 states and 275543 transitions. [2019-11-15 23:37:31,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 76146 states and 275543 transitions. [2019-11-15 23:37:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:37:31,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:31,374 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] [2019-11-15 23:37:31,374 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash -566767197, now seen corresponding path program 1 times [2019-11-15 23:37:31,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:31,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790674852] [2019-11-15 23:37:31,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:31,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:31,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:31,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790674852] [2019-11-15 23:37:31,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:31,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:31,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590915212] [2019-11-15 23:37:31,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:31,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:31,472 INFO L87 Difference]: Start difference. First operand 76146 states and 275543 transitions. Second operand 5 states. [2019-11-15 23:37:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:31,606 INFO L93 Difference]: Finished difference Result 19614 states and 62264 transitions. [2019-11-15 23:37:31,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:31,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 23:37:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:31,643 INFO L225 Difference]: With dead ends: 19614 [2019-11-15 23:37:31,643 INFO L226 Difference]: Without dead ends: 19136 [2019-11-15 23:37:31,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19136 states. [2019-11-15 23:37:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19136 to 19124. [2019-11-15 23:37:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19124 states. [2019-11-15 23:37:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19124 states to 19124 states and 60759 transitions. [2019-11-15 23:37:31,989 INFO L78 Accepts]: Start accepts. Automaton has 19124 states and 60759 transitions. Word has length 69 [2019-11-15 23:37:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:31,989 INFO L462 AbstractCegarLoop]: Abstraction has 19124 states and 60759 transitions. [2019-11-15 23:37:31,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19124 states and 60759 transitions. [2019-11-15 23:37:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 23:37:32,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:32,014 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] [2019-11-15 23:37:32,014 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1633264562, now seen corresponding path program 1 times [2019-11-15 23:37:32,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:32,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970275714] [2019-11-15 23:37:32,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:32,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:32,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:32,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970275714] [2019-11-15 23:37:32,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:32,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:32,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695914692] [2019-11-15 23:37:32,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:37:32,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:32,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:32,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:32,107 INFO L87 Difference]: Start difference. First operand 19124 states and 60759 transitions. Second operand 4 states. [2019-11-15 23:37:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:32,420 INFO L93 Difference]: Finished difference Result 24074 states and 75427 transitions. [2019-11-15 23:37:32,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:32,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 23:37:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:32,473 INFO L225 Difference]: With dead ends: 24074 [2019-11-15 23:37:32,473 INFO L226 Difference]: Without dead ends: 24074 [2019-11-15 23:37:32,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24074 states. [2019-11-15 23:37:32,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24074 to 19964. [2019-11-15 23:37:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19964 states. [2019-11-15 23:37:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19964 states to 19964 states and 63126 transitions. [2019-11-15 23:37:32,794 INFO L78 Accepts]: Start accepts. Automaton has 19964 states and 63126 transitions. Word has length 78 [2019-11-15 23:37:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:32,794 INFO L462 AbstractCegarLoop]: Abstraction has 19964 states and 63126 transitions. [2019-11-15 23:37:32,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:37:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19964 states and 63126 transitions. [2019-11-15 23:37:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 23:37:32,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:32,810 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] [2019-11-15 23:37:32,810 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1378528017, now seen corresponding path program 1 times [2019-11-15 23:37:32,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:32,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194555872] [2019-11-15 23:37:32,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:32,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:32,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:32,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194555872] [2019-11-15 23:37:32,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:32,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:37:32,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857457260] [2019-11-15 23:37:32,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:37:32,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:37:32,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:37:32,899 INFO L87 Difference]: Start difference. First operand 19964 states and 63126 transitions. Second operand 8 states. [2019-11-15 23:37:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:33,802 INFO L93 Difference]: Finished difference Result 22070 states and 69318 transitions. [2019-11-15 23:37:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:37:33,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-11-15 23:37:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:33,845 INFO L225 Difference]: With dead ends: 22070 [2019-11-15 23:37:33,846 INFO L226 Difference]: Without dead ends: 22022 [2019-11-15 23:37:33,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:37:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2019-11-15 23:37:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19436. [2019-11-15 23:37:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19436 states. [2019-11-15 23:37:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 61628 transitions. [2019-11-15 23:37:34,157 INFO L78 Accepts]: Start accepts. Automaton has 19436 states and 61628 transitions. Word has length 78 [2019-11-15 23:37:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:34,157 INFO L462 AbstractCegarLoop]: Abstraction has 19436 states and 61628 transitions. [2019-11-15 23:37:34,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:37:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19436 states and 61628 transitions. [2019-11-15 23:37:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:37:34,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:34,177 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] [2019-11-15 23:37:34,177 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1605165811, now seen corresponding path program 1 times [2019-11-15 23:37:34,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:34,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80907574] [2019-11-15 23:37:34,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:34,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:34,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:34,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80907574] [2019-11-15 23:37:34,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:34,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:37:34,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547936195] [2019-11-15 23:37:34,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:37:34,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:37:34,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:37:34,287 INFO L87 Difference]: Start difference. First operand 19436 states and 61628 transitions. Second operand 8 states. [2019-11-15 23:37:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:36,160 INFO L93 Difference]: Finished difference Result 50430 states and 153646 transitions. [2019-11-15 23:37:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 23:37:36,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-11-15 23:37:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:36,251 INFO L225 Difference]: With dead ends: 50430 [2019-11-15 23:37:36,251 INFO L226 Difference]: Without dead ends: 49731 [2019-11-15 23:37:36,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:37:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49731 states. [2019-11-15 23:37:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49731 to 29964. [2019-11-15 23:37:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29964 states. [2019-11-15 23:37:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29964 states to 29964 states and 93558 transitions. [2019-11-15 23:37:36,821 INFO L78 Accepts]: Start accepts. Automaton has 29964 states and 93558 transitions. Word has length 81 [2019-11-15 23:37:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:36,822 INFO L462 AbstractCegarLoop]: Abstraction has 29964 states and 93558 transitions. [2019-11-15 23:37:36,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:37:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29964 states and 93558 transitions. [2019-11-15 23:37:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:37:36,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:36,854 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] [2019-11-15 23:37:36,854 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash -643551794, now seen corresponding path program 1 times [2019-11-15 23:37:36,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:36,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225493926] [2019-11-15 23:37:36,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:36,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:36,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:36,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225493926] [2019-11-15 23:37:36,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:36,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:36,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424716119] [2019-11-15 23:37:36,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:36,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:36,990 INFO L87 Difference]: Start difference. First operand 29964 states and 93558 transitions. Second operand 6 states. [2019-11-15 23:37:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:37,482 INFO L93 Difference]: Finished difference Result 31402 states and 97495 transitions. [2019-11-15 23:37:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:37,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-15 23:37:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:37,539 INFO L225 Difference]: With dead ends: 31402 [2019-11-15 23:37:37,539 INFO L226 Difference]: Without dead ends: 31402 [2019-11-15 23:37:37,539 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-11-15 23:37:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31402 states. [2019-11-15 23:37:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31402 to 29633. [2019-11-15 23:37:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29633 states. [2019-11-15 23:37:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29633 states to 29633 states and 92401 transitions. [2019-11-15 23:37:38,693 INFO L78 Accepts]: Start accepts. Automaton has 29633 states and 92401 transitions. Word has length 81 [2019-11-15 23:37:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:38,694 INFO L462 AbstractCegarLoop]: Abstraction has 29633 states and 92401 transitions. [2019-11-15 23:37:38,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29633 states and 92401 transitions. [2019-11-15 23:37:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:37:38,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:38,721 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] [2019-11-15 23:37:38,722 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1715755215, now seen corresponding path program 1 times [2019-11-15 23:37:38,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:38,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538001360] [2019-11-15 23:37:38,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:38,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:38,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:38,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538001360] [2019-11-15 23:37:38,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:38,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:37:38,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721195438] [2019-11-15 23:37:38,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:38,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:38,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:38,818 INFO L87 Difference]: Start difference. First operand 29633 states and 92401 transitions. Second operand 7 states. [2019-11-15 23:37:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:39,446 INFO L93 Difference]: Finished difference Result 31147 states and 96557 transitions. [2019-11-15 23:37:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:37:39,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-11-15 23:37:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:39,493 INFO L225 Difference]: With dead ends: 31147 [2019-11-15 23:37:39,493 INFO L226 Difference]: Without dead ends: 31147 [2019-11-15 23:37:39,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:37:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31147 states. [2019-11-15 23:37:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31147 to 29965. [2019-11-15 23:37:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-11-15 23:37:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93232 transitions. [2019-11-15 23:37:39,925 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93232 transitions. Word has length 81 [2019-11-15 23:37:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:39,925 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93232 transitions. [2019-11-15 23:37:39,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93232 transitions. [2019-11-15 23:37:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:37:39,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:39,957 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] [2019-11-15 23:37:39,957 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:39,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:39,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2045520976, now seen corresponding path program 1 times [2019-11-15 23:37:39,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:39,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456436844] [2019-11-15 23:37:39,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:39,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:39,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:40,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456436844] [2019-11-15 23:37:40,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:40,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:40,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189552736] [2019-11-15 23:37:40,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:37:40,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:37:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:40,008 INFO L87 Difference]: Start difference. First operand 29965 states and 93232 transitions. Second operand 3 states. [2019-11-15 23:37:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:40,109 INFO L93 Difference]: Finished difference Result 21486 states and 66269 transitions. [2019-11-15 23:37:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:37:40,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-15 23:37:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:40,153 INFO L225 Difference]: With dead ends: 21486 [2019-11-15 23:37:40,153 INFO L226 Difference]: Without dead ends: 21486 [2019-11-15 23:37:40,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:37:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21486 states. [2019-11-15 23:37:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21486 to 21163. [2019-11-15 23:37:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21163 states. [2019-11-15 23:37:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21163 states to 21163 states and 65320 transitions. [2019-11-15 23:37:40,524 INFO L78 Accepts]: Start accepts. Automaton has 21163 states and 65320 transitions. Word has length 81 [2019-11-15 23:37:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:40,525 INFO L462 AbstractCegarLoop]: Abstraction has 21163 states and 65320 transitions. [2019-11-15 23:37:40,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:37:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21163 states and 65320 transitions. [2019-11-15 23:37:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:40,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:40,551 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] [2019-11-15 23:37:40,552 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash -160973374, now seen corresponding path program 1 times [2019-11-15 23:37:40,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:40,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965480649] [2019-11-15 23:37:40,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:40,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:40,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:40,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965480649] [2019-11-15 23:37:40,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:40,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:40,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185682472] [2019-11-15 23:37:40,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:37:40,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:40,626 INFO L87 Difference]: Start difference. First operand 21163 states and 65320 transitions. Second operand 4 states. [2019-11-15 23:37:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:40,939 INFO L93 Difference]: Finished difference Result 26080 states and 79433 transitions. [2019-11-15 23:37:40,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:37:40,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 23:37:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:40,978 INFO L225 Difference]: With dead ends: 26080 [2019-11-15 23:37:40,979 INFO L226 Difference]: Without dead ends: 25972 [2019-11-15 23:37:40,979 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-11-15 23:37:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25972 states. [2019-11-15 23:37:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25972 to 23743. [2019-11-15 23:37:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23743 states. [2019-11-15 23:37:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23743 states to 23743 states and 72888 transitions. [2019-11-15 23:37:41,320 INFO L78 Accepts]: Start accepts. Automaton has 23743 states and 72888 transitions. Word has length 82 [2019-11-15 23:37:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:41,320 INFO L462 AbstractCegarLoop]: Abstraction has 23743 states and 72888 transitions. [2019-11-15 23:37:41,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:37:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23743 states and 72888 transitions. [2019-11-15 23:37:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:41,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:41,344 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] [2019-11-15 23:37:41,344 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1083656957, now seen corresponding path program 1 times [2019-11-15 23:37:41,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:41,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916821745] [2019-11-15 23:37:41,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:41,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:41,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:41,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916821745] [2019-11-15 23:37:41,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:41,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:41,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413765842] [2019-11-15 23:37:41,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:41,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:41,450 INFO L87 Difference]: Start difference. First operand 23743 states and 72888 transitions. Second operand 6 states. [2019-11-15 23:37:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:41,917 INFO L93 Difference]: Finished difference Result 26033 states and 79294 transitions. [2019-11-15 23:37:41,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:41,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-15 23:37:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:41,957 INFO L225 Difference]: With dead ends: 26033 [2019-11-15 23:37:41,957 INFO L226 Difference]: Without dead ends: 26009 [2019-11-15 23:37:41,957 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-11-15 23:37:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26009 states. [2019-11-15 23:37:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26009 to 25008. [2019-11-15 23:37:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25008 states. [2019-11-15 23:37:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25008 states to 25008 states and 76355 transitions. [2019-11-15 23:37:42,320 INFO L78 Accepts]: Start accepts. Automaton has 25008 states and 76355 transitions. Word has length 82 [2019-11-15 23:37:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:42,320 INFO L462 AbstractCegarLoop]: Abstraction has 25008 states and 76355 transitions. [2019-11-15 23:37:42,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 25008 states and 76355 transitions. [2019-11-15 23:37:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:42,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:42,342 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] [2019-11-15 23:37:42,343 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1275650052, now seen corresponding path program 1 times [2019-11-15 23:37:42,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:42,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458448754] [2019-11-15 23:37:42,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:42,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:42,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:42,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458448754] [2019-11-15 23:37:42,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:42,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:42,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495689109] [2019-11-15 23:37:42,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:42,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:42,452 INFO L87 Difference]: Start difference. First operand 25008 states and 76355 transitions. Second operand 6 states. [2019-11-15 23:37:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:42,958 INFO L93 Difference]: Finished difference Result 32577 states and 96112 transitions. [2019-11-15 23:37:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:37:42,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-15 23:37:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:43,002 INFO L225 Difference]: With dead ends: 32577 [2019-11-15 23:37:43,002 INFO L226 Difference]: Without dead ends: 32564 [2019-11-15 23:37:43,003 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-11-15 23:37:43,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32564 states. [2019-11-15 23:37:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32564 to 27961. [2019-11-15 23:37:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27961 states. [2019-11-15 23:37:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27961 states to 27961 states and 83312 transitions. [2019-11-15 23:37:43,423 INFO L78 Accepts]: Start accepts. Automaton has 27961 states and 83312 transitions. Word has length 82 [2019-11-15 23:37:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:43,423 INFO L462 AbstractCegarLoop]: Abstraction has 27961 states and 83312 transitions. [2019-11-15 23:37:43,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27961 states and 83312 transitions. [2019-11-15 23:37:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:43,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:43,446 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] [2019-11-15 23:37:43,446 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1605415813, now seen corresponding path program 1 times [2019-11-15 23:37:43,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:43,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895031167] [2019-11-15 23:37:43,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:43,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895031167] [2019-11-15 23:37:43,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:43,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:43,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600648552] [2019-11-15 23:37:43,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:43,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:43,518 INFO L87 Difference]: Start difference. First operand 27961 states and 83312 transitions. Second operand 5 states. [2019-11-15 23:37:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:44,031 INFO L93 Difference]: Finished difference Result 33403 states and 98789 transitions. [2019-11-15 23:37:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:37:44,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-15 23:37:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:44,090 INFO L225 Difference]: With dead ends: 33403 [2019-11-15 23:37:44,091 INFO L226 Difference]: Without dead ends: 33403 [2019-11-15 23:37:44,091 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-11-15 23:37:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33403 states. [2019-11-15 23:37:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33403 to 27283. [2019-11-15 23:37:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27283 states. [2019-11-15 23:37:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27283 states to 27283 states and 81291 transitions. [2019-11-15 23:37:44,507 INFO L78 Accepts]: Start accepts. Automaton has 27283 states and 81291 transitions. Word has length 82 [2019-11-15 23:37:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:44,508 INFO L462 AbstractCegarLoop]: Abstraction has 27283 states and 81291 transitions. [2019-11-15 23:37:44,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27283 states and 81291 transitions. [2019-11-15 23:37:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:44,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:44,533 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] [2019-11-15 23:37:44,533 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash -404688028, now seen corresponding path program 1 times [2019-11-15 23:37:44,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:44,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469048408] [2019-11-15 23:37:44,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:44,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:44,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:44,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469048408] [2019-11-15 23:37:44,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:44,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:44,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829493149] [2019-11-15 23:37:44,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:37:44,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:44,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:44,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:44,595 INFO L87 Difference]: Start difference. First operand 27283 states and 81291 transitions. Second operand 4 states. [2019-11-15 23:37:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:44,944 INFO L93 Difference]: Finished difference Result 31432 states and 92484 transitions. [2019-11-15 23:37:44,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:44,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 23:37:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:44,994 INFO L225 Difference]: With dead ends: 31432 [2019-11-15 23:37:44,994 INFO L226 Difference]: Without dead ends: 30982 [2019-11-15 23:37:44,996 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-11-15 23:37:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-11-15 23:37:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 26929. [2019-11-15 23:37:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26929 states. [2019-11-15 23:37:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26929 states to 26929 states and 80065 transitions. [2019-11-15 23:37:45,867 INFO L78 Accepts]: Start accepts. Automaton has 26929 states and 80065 transitions. Word has length 82 [2019-11-15 23:37:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:45,868 INFO L462 AbstractCegarLoop]: Abstraction has 26929 states and 80065 transitions. [2019-11-15 23:37:45,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:37:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26929 states and 80065 transitions. [2019-11-15 23:37:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:45,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:45,892 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] [2019-11-15 23:37:45,892 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash -687838492, now seen corresponding path program 1 times [2019-11-15 23:37:45,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:45,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469484262] [2019-11-15 23:37:45,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:45,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:45,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:45,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469484262] [2019-11-15 23:37:45,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:45,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:45,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686116566] [2019-11-15 23:37:45,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:45,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:45,972 INFO L87 Difference]: Start difference. First operand 26929 states and 80065 transitions. Second operand 5 states. [2019-11-15 23:37:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:46,308 INFO L93 Difference]: Finished difference Result 23125 states and 67572 transitions. [2019-11-15 23:37:46,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:37:46,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-15 23:37:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:46,337 INFO L225 Difference]: With dead ends: 23125 [2019-11-15 23:37:46,337 INFO L226 Difference]: Without dead ends: 22969 [2019-11-15 23:37:46,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22969 states. [2019-11-15 23:37:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22969 to 18282. [2019-11-15 23:37:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2019-11-15 23:37:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 54149 transitions. [2019-11-15 23:37:46,604 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 54149 transitions. Word has length 82 [2019-11-15 23:37:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:46,604 INFO L462 AbstractCegarLoop]: Abstraction has 18282 states and 54149 transitions. [2019-11-15 23:37:46,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 54149 transitions. [2019-11-15 23:37:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:37:46,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:46,620 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] [2019-11-15 23:37:46,620 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash 556925989, now seen corresponding path program 1 times [2019-11-15 23:37:46,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:46,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562130919] [2019-11-15 23:37:46,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:46,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:46,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:46,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562130919] [2019-11-15 23:37:46,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:46,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:46,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810670309] [2019-11-15 23:37:46,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:46,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:46,696 INFO L87 Difference]: Start difference. First operand 18282 states and 54149 transitions. Second operand 5 states. [2019-11-15 23:37:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:46,745 INFO L93 Difference]: Finished difference Result 2364 states and 5647 transitions. [2019-11-15 23:37:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:46,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-15 23:37:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:46,749 INFO L225 Difference]: With dead ends: 2364 [2019-11-15 23:37:46,749 INFO L226 Difference]: Without dead ends: 2076 [2019-11-15 23:37:46,749 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-11-15 23:37:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2019-11-15 23:37:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2021. [2019-11-15 23:37:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-11-15 23:37:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 4817 transitions. [2019-11-15 23:37:46,779 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 4817 transitions. Word has length 82 [2019-11-15 23:37:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:46,780 INFO L462 AbstractCegarLoop]: Abstraction has 2021 states and 4817 transitions. [2019-11-15 23:37:46,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 4817 transitions. [2019-11-15 23:37:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:46,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:46,783 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:46,783 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1296603107, now seen corresponding path program 1 times [2019-11-15 23:37:46,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:46,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312433050] [2019-11-15 23:37:46,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:46,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:46,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312433050] [2019-11-15 23:37:46,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:46,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:46,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926625196] [2019-11-15 23:37:46,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:46,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:46,867 INFO L87 Difference]: Start difference. First operand 2021 states and 4817 transitions. Second operand 5 states. [2019-11-15 23:37:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:47,301 INFO L93 Difference]: Finished difference Result 2371 states and 5549 transitions. [2019-11-15 23:37:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:47,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:37:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:47,304 INFO L225 Difference]: With dead ends: 2371 [2019-11-15 23:37:47,304 INFO L226 Difference]: Without dead ends: 2353 [2019-11-15 23:37:47,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-11-15 23:37:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2074. [2019-11-15 23:37:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-15 23:37:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4920 transitions. [2019-11-15 23:37:47,331 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4920 transitions. Word has length 95 [2019-11-15 23:37:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:47,331 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4920 transitions. [2019-11-15 23:37:47,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4920 transitions. [2019-11-15 23:37:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:47,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:47,334 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:47,334 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1172529860, now seen corresponding path program 1 times [2019-11-15 23:37:47,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:47,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429233426] [2019-11-15 23:37:47,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:47,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:47,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:47,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429233426] [2019-11-15 23:37:47,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:47,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:47,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525978638] [2019-11-15 23:37:47,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:47,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:47,415 INFO L87 Difference]: Start difference. First operand 2074 states and 4920 transitions. Second operand 5 states. [2019-11-15 23:37:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:47,630 INFO L93 Difference]: Finished difference Result 2463 states and 5723 transitions. [2019-11-15 23:37:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:47,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:37:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:47,633 INFO L225 Difference]: With dead ends: 2463 [2019-11-15 23:37:47,633 INFO L226 Difference]: Without dead ends: 2445 [2019-11-15 23:37:47,633 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-11-15 23:37:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2019-11-15 23:37:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2140. [2019-11-15 23:37:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-11-15 23:37:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 5048 transitions. [2019-11-15 23:37:47,664 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 5048 transitions. Word has length 95 [2019-11-15 23:37:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:47,665 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 5048 transitions. [2019-11-15 23:37:47,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 5048 transitions. [2019-11-15 23:37:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:47,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:47,668 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:47,668 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2121767486, now seen corresponding path program 1 times [2019-11-15 23:37:47,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:47,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18110064] [2019-11-15 23:37:47,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:47,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:47,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:47,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18110064] [2019-11-15 23:37:47,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:47,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:47,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124807094] [2019-11-15 23:37:47,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:47,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:47,808 INFO L87 Difference]: Start difference. First operand 2140 states and 5048 transitions. Second operand 6 states. [2019-11-15 23:37:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:48,116 INFO L93 Difference]: Finished difference Result 2293 states and 5327 transitions. [2019-11-15 23:37:48,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:37:48,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 23:37:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:48,119 INFO L225 Difference]: With dead ends: 2293 [2019-11-15 23:37:48,119 INFO L226 Difference]: Without dead ends: 2293 [2019-11-15 23:37:48,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:37:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-11-15 23:37:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2128. [2019-11-15 23:37:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-11-15 23:37:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 5005 transitions. [2019-11-15 23:37:48,141 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 5005 transitions. Word has length 95 [2019-11-15 23:37:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:48,142 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 5005 transitions. [2019-11-15 23:37:48,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 5005 transitions. [2019-11-15 23:37:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:48,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:48,144 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:48,144 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1843434049, now seen corresponding path program 1 times [2019-11-15 23:37:48,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:48,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020176899] [2019-11-15 23:37:48,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:48,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:48,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:48,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020176899] [2019-11-15 23:37:48,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:48,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:48,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835002157] [2019-11-15 23:37:48,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:48,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:48,247 INFO L87 Difference]: Start difference. First operand 2128 states and 5005 transitions. Second operand 6 states. [2019-11-15 23:37:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:48,391 INFO L93 Difference]: Finished difference Result 2318 states and 5399 transitions. [2019-11-15 23:37:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:48,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 23:37:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:48,393 INFO L225 Difference]: With dead ends: 2318 [2019-11-15 23:37:48,393 INFO L226 Difference]: Without dead ends: 2318 [2019-11-15 23:37:48,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-15 23:37:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2110. [2019-11-15 23:37:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-11-15 23:37:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 4969 transitions. [2019-11-15 23:37:48,411 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 4969 transitions. Word has length 95 [2019-11-15 23:37:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:48,411 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 4969 transitions. [2019-11-15 23:37:48,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 4969 transitions. [2019-11-15 23:37:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:48,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:48,413 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:48,413 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1199623873, now seen corresponding path program 1 times [2019-11-15 23:37:48,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:48,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631557745] [2019-11-15 23:37:48,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:48,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:48,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:48,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631557745] [2019-11-15 23:37:48,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:48,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:48,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489870648] [2019-11-15 23:37:48,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:48,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:48,503 INFO L87 Difference]: Start difference. First operand 2110 states and 4969 transitions. Second operand 5 states. [2019-11-15 23:37:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:48,539 INFO L93 Difference]: Finished difference Result 3067 states and 7324 transitions. [2019-11-15 23:37:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:48,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:37:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:48,543 INFO L225 Difference]: With dead ends: 3067 [2019-11-15 23:37:48,543 INFO L226 Difference]: Without dead ends: 3067 [2019-11-15 23:37:48,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2019-11-15 23:37:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 1998. [2019-11-15 23:37:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-11-15 23:37:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4683 transitions. [2019-11-15 23:37:48,578 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4683 transitions. Word has length 95 [2019-11-15 23:37:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:48,578 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4683 transitions. [2019-11-15 23:37:48,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4683 transitions. [2019-11-15 23:37:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:48,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:48,581 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:48,582 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash -869858112, now seen corresponding path program 1 times [2019-11-15 23:37:48,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:48,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706579519] [2019-11-15 23:37:48,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:48,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:48,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:48,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706579519] [2019-11-15 23:37:48,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:48,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:37:48,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853515932] [2019-11-15 23:37:48,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:37:48,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:48,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:37:48,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:37:48,770 INFO L87 Difference]: Start difference. First operand 1998 states and 4683 transitions. Second operand 11 states. [2019-11-15 23:37:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:49,067 INFO L93 Difference]: Finished difference Result 3167 states and 7548 transitions. [2019-11-15 23:37:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:37:49,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-11-15 23:37:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:49,070 INFO L225 Difference]: With dead ends: 3167 [2019-11-15 23:37:49,070 INFO L226 Difference]: Without dead ends: 2528 [2019-11-15 23:37:49,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:37:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-11-15 23:37:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2416. [2019-11-15 23:37:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-11-15 23:37:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 5600 transitions. [2019-11-15 23:37:49,107 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 5600 transitions. Word has length 95 [2019-11-15 23:37:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:49,107 INFO L462 AbstractCegarLoop]: Abstraction has 2416 states and 5600 transitions. [2019-11-15 23:37:49,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:37:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 5600 transitions. [2019-11-15 23:37:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:49,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:49,111 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:49,111 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1495373691, now seen corresponding path program 2 times [2019-11-15 23:37:49,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:49,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481253481] [2019-11-15 23:37:49,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:49,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:49,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:49,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481253481] [2019-11-15 23:37:49,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:49,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:49,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825352550] [2019-11-15 23:37:49,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:49,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:49,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:49,261 INFO L87 Difference]: Start difference. First operand 2416 states and 5600 transitions. Second operand 6 states. [2019-11-15 23:37:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:49,448 INFO L93 Difference]: Finished difference Result 2598 states and 5921 transitions. [2019-11-15 23:37:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:37:49,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 23:37:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:49,451 INFO L225 Difference]: With dead ends: 2598 [2019-11-15 23:37:49,451 INFO L226 Difference]: Without dead ends: 2552 [2019-11-15 23:37:49,451 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-11-15 23:37:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-11-15 23:37:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2390. [2019-11-15 23:37:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-11-15 23:37:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 5521 transitions. [2019-11-15 23:37:49,483 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 5521 transitions. Word has length 95 [2019-11-15 23:37:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:49,484 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 5521 transitions. [2019-11-15 23:37:49,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 5521 transitions. [2019-11-15 23:37:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:37:49,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:49,487 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:49,487 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:37:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1046677052, now seen corresponding path program 2 times [2019-11-15 23:37:49,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:49,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229973312] [2019-11-15 23:37:49,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:49,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:49,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:49,586 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:49,586 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:37:49,755 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:37:49,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:37:49 BasicIcfg [2019-11-15 23:37:49,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:37:49,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:37:49,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:37:49,757 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:37:49,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:55" (3/4) ... [2019-11-15 23:37:49,760 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:37:49,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9054c28e-5f22-48c3-ab3a-67a3ef894c81/bin/uautomizer/witness.graphml [2019-11-15 23:37:49,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:37:49,921 INFO L168 Benchmark]: Toolchain (without parser) took 56566.46 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 944.7 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:37:49,922 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:49,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:49,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.55 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-11-15 23:37:49,923 INFO L168 Benchmark]: Boogie Preprocessor took 41.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:49,924 INFO L168 Benchmark]: RCFGBuilder took 759.41 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.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:49,925 INFO L168 Benchmark]: TraceAbstraction took 54739.48 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:37:49,925 INFO L168 Benchmark]: Witness Printer took 161.80 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:49,928 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 797.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.55 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 41.64 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 759.41 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.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54739.48 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 161.80 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 0 pthread_t t1591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L788] 0 pthread_t t1592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L796] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 0 x = x$flush_delayed ? x$mem_tmp : x [L815] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 176 locations, 3 error locations. Result: UNSAFE, OverallTime: 54.6s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8798 SDtfs, 9842 SDslu, 21271 SDs, 0 SdLazy, 9862 SolverSat, 640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 98 SyntacticMatches, 26 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76146occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 129254 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2585 NumberOfCodeBlocks, 2585 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2457 ConstructedInterpolants, 0 QuantifiedInterpolants, 458667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...