java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:59:36,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:59:36,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:59:36,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:59:36,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:59:36,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:59:36,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:59:36,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:59:36,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:59:36,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:59:36,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:59:36,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:59:36,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:59:36,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:59:36,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:59:36,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:59:36,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:59:36,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:59:36,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:59:36,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:59:36,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:59:36,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:59:36,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:59:36,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:59:36,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:59:36,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:59:36,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:59:36,554 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:59:36,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:59:36,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:59:36,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:59:36,555 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:59:36,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:59:36,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:59:36,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:59:36,566 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:59:36,566 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:59:36,566 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:59:36,566 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:59:36,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:59:36,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:59:36,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:59:36,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:59:36,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:59:36,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:59:36,568 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:59:36,568 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:59:36,568 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:59:36,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:59:36,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:59:36,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:59:36,569 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:59:36,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:59:36,570 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:59:36,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:59:36,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:59:36,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:59:36,570 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:59:36,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:59:36,571 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:59:36,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:59:36,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:59:36,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:59:36,572 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:59:36,572 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:59:36,572 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:59:36,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:59:36,617 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:59:36,621 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:59:36,622 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:59:36,622 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:59:36,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-01-29 23:59:36,789 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:59:36,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:59:36,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:59:36,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:59:36,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:59:36,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:59:36" (1/1) ... [2018-01-29 23:59:36,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df768b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:36, skipping insertion in model container [2018-01-29 23:59:36,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:59:36" (1/1) ... [2018-01-29 23:59:36,827 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:59:36,879 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:59:36,987 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:59:37,003 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:59:37,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37 WrapperNode [2018-01-29 23:59:37,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:59:37,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:59:37,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:59:37,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:59:37,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... [2018-01-29 23:59:37,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:59:37,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:59:37,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:59:37,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:59:37,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:59:37,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:59:37,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:59:37,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-29 23:59:37,090 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-01-29 23:59:37,091 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-01-29 23:59:37,091 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-01-29 23:59:37,091 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-01-29 23:59:37,091 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-01-29 23:59:37,091 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-29 23:59:37,091 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:59:37,091 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:59:37,091 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:59:37,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-29 23:59:37,092 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-01-29 23:59:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-01-29 23:59:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-01-29 23:59:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-01-29 23:59:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-01-29 23:59:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-29 23:59:37,093 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:59:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:59:37,094 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:59:37,382 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:59:37,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:59:37 BoogieIcfgContainer [2018-01-29 23:59:37,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:59:37,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:59:37,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:59:37,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:59:37,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:59:36" (1/3) ... [2018-01-29 23:59:37,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f55ab20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:59:37, skipping insertion in model container [2018-01-29 23:59:37,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:59:37" (2/3) ... [2018-01-29 23:59:37,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f55ab20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:59:37, skipping insertion in model container [2018-01-29 23:59:37,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:59:37" (3/3) ... [2018-01-29 23:59:37,391 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-01-29 23:59:37,401 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:59:37,408 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-29 23:59:37,455 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:59:37,455 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:59:37,455 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:59:37,455 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:59:37,455 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:59:37,455 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:59:37,455 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:59:37,455 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:59:37,456 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:59:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-01-29 23:59:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 23:59:37,476 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:37,477 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:37,477 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1039497959, now seen corresponding path program 1 times [2018-01-29 23:59:37,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:37,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:37,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:37,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:37,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:37,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:37,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:37,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:59:37,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:37,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:37,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:37,832 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 6 states. [2018-01-29 23:59:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:38,160 INFO L93 Difference]: Finished difference Result 178 states and 202 transitions. [2018-01-29 23:59:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:59:38,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-29 23:59:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:38,174 INFO L225 Difference]: With dead ends: 178 [2018-01-29 23:59:38,174 INFO L226 Difference]: Without dead ends: 172 [2018-01-29 23:59:38,178 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-29 23:59:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2018-01-29 23:59:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-29 23:59:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-01-29 23:59:38,224 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 20 [2018-01-29 23:59:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:38,225 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-01-29 23:59:38,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-01-29 23:59:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 23:59:38,227 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:38,227 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:38,227 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1039497960, now seen corresponding path program 1 times [2018-01-29 23:59:38,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:38,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:38,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:38,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:38,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:38,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:38,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:38,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:59:38,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:38,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:38,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:38,370 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 6 states. [2018-01-29 23:59:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:38,667 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2018-01-29 23:59:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:59:38,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-29 23:59:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:38,670 INFO L225 Difference]: With dead ends: 165 [2018-01-29 23:59:38,670 INFO L226 Difference]: Without dead ends: 162 [2018-01-29 23:59:38,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-29 23:59:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2018-01-29 23:59:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-29 23:59:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-01-29 23:59:38,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 20 [2018-01-29 23:59:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:38,692 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-01-29 23:59:38,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-01-29 23:59:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:59:38,693 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:38,694 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:38,694 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1508699396, now seen corresponding path program 1 times [2018-01-29 23:59:38,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:38,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:38,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:38,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:38,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:38,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:38,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:38,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:38,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:59:38,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:59:38,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:38,857 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 8 states. [2018-01-29 23:59:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:39,286 INFO L93 Difference]: Finished difference Result 192 states and 220 transitions. [2018-01-29 23:59:39,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:59:39,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-29 23:59:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:39,288 INFO L225 Difference]: With dead ends: 192 [2018-01-29 23:59:39,288 INFO L226 Difference]: Without dead ends: 190 [2018-01-29 23:59:39,289 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:59:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-29 23:59:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 135. [2018-01-29 23:59:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-29 23:59:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-01-29 23:59:39,306 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 21 [2018-01-29 23:59:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:39,306 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-01-29 23:59:39,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:59:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-01-29 23:59:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:59:39,307 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:39,307 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:39,307 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1508699395, now seen corresponding path program 1 times [2018-01-29 23:59:39,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:39,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:39,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:39,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:39,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:39,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:39,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:39,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:59:39,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:59:39,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:59:39,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:39,449 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 9 states. [2018-01-29 23:59:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:39,863 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2018-01-29 23:59:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:59:39,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-29 23:59:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:39,865 INFO L225 Difference]: With dead ends: 196 [2018-01-29 23:59:39,865 INFO L226 Difference]: Without dead ends: 193 [2018-01-29 23:59:39,866 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:59:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-29 23:59:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 103. [2018-01-29 23:59:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-29 23:59:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-01-29 23:59:39,882 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 21 [2018-01-29 23:59:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:39,882 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-01-29 23:59:39,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:59:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-01-29 23:59:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:59:39,884 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:39,884 INFO L350 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] [2018-01-29 23:59:39,884 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1163641768, now seen corresponding path program 1 times [2018-01-29 23:59:39,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:39,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:39,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:39,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:39,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:39,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59: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. [2018-01-29 23:59:40,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:40,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:40,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:59:40,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:59:40,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:40,007 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 8 states. [2018-01-29 23:59:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:40,127 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-01-29 23:59:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:59:40,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-29 23:59:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:40,129 INFO L225 Difference]: With dead ends: 119 [2018-01-29 23:59:40,129 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 23:59:40,129 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 23:59:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-01-29 23:59:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 23:59:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2018-01-29 23:59:40,144 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 34 [2018-01-29 23:59:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:40,145 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2018-01-29 23:59:40,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:59:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2018-01-29 23:59:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:59:40,146 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:40,146 INFO L350 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] [2018-01-29 23:59:40,146 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1163641769, now seen corresponding path program 1 times [2018-01-29 23:59:40,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:40,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:40,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:40,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:40,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:40,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:40,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:40,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:59:40,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:40,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:40,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:40,210 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 6 states. [2018-01-29 23:59:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:40,253 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-29 23:59:40,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:59:40,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-29 23:59:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:40,255 INFO L225 Difference]: With dead ends: 141 [2018-01-29 23:59:40,255 INFO L226 Difference]: Without dead ends: 114 [2018-01-29 23:59:40,255 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-29 23:59:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-01-29 23:59:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-29 23:59:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-01-29 23:59:40,266 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 34 [2018-01-29 23:59:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:40,267 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-01-29 23:59:40,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-01-29 23:59:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 23:59:40,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:40,268 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:40,268 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1870152642, now seen corresponding path program 1 times [2018-01-29 23:59:40,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:40,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:40,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:40,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:40,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:40,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:40,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:40,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:59:40,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:40,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:40,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:40,336 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 6 states. [2018-01-29 23:59:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:40,501 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2018-01-29 23:59:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:59:40,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-29 23:59:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:40,503 INFO L225 Difference]: With dead ends: 166 [2018-01-29 23:59:40,503 INFO L226 Difference]: Without dead ends: 164 [2018-01-29 23:59:40,503 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-29 23:59:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2018-01-29 23:59:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 23:59:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-29 23:59:40,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 35 [2018-01-29 23:59:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:40,514 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-29 23:59:40,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-29 23:59:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-29 23:59:40,515 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:40,515 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:40,516 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1870152641, now seen corresponding path program 1 times [2018-01-29 23:59:40,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:40,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:40,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:40,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:40,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:40,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 23:59:40,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:40,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:40,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:59:40,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:59:40,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:40,680 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 8 states. [2018-01-29 23:59:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:41,255 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2018-01-29 23:59:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:59:41,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-29 23:59:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:41,257 INFO L225 Difference]: With dead ends: 179 [2018-01-29 23:59:41,257 INFO L226 Difference]: Without dead ends: 177 [2018-01-29 23:59:41,258 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:59:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-29 23:59:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 139. [2018-01-29 23:59:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-29 23:59:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2018-01-29 23:59:41,270 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 35 [2018-01-29 23:59:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:41,270 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2018-01-29 23:59:41,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:59:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2018-01-29 23:59:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 23:59:41,272 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:41,272 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:41,272 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1736333194, now seen corresponding path program 1 times [2018-01-29 23:59:41,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:41,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:41,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:41,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:41,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:41,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:41,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:41,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:59:41,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:59:41,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:59:41,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:41,408 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand 9 states. [2018-01-29 23:59:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:41,705 INFO L93 Difference]: Finished difference Result 182 states and 204 transitions. [2018-01-29 23:59:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:59:41,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-29 23:59:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:41,706 INFO L225 Difference]: With dead ends: 182 [2018-01-29 23:59:41,706 INFO L226 Difference]: Without dead ends: 180 [2018-01-29 23:59:41,707 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:59:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-29 23:59:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2018-01-29 23:59:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 23:59:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-29 23:59:41,719 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 36 [2018-01-29 23:59:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:41,720 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-29 23:59:41,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:59:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-29 23:59:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 23:59:41,720 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:41,720 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:41,720 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1513566001, now seen corresponding path program 1 times [2018-01-29 23:59:41,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:41,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:41,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:41,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:41,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:41,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:59:41,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:59:41,834 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:59:41,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:41,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:59:41,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:59:41,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:59:41,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:41,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:41,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:59:41,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:59:41,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:41,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:41,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:41,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-01-29 23:59:41,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-29 23:59:41,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-29 23:59:41,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:41,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:42,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-29 23:59:42,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-29 23:59:42,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:42,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:42,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:42,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-01-29 23:59:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:42,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:59:42,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-01-29 23:59:42,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:59:42,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:59:42,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:59:42,060 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 7 states. [2018-01-29 23:59:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:42,154 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2018-01-29 23:59:42,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:59:42,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-29 23:59:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:42,156 INFO L225 Difference]: With dead ends: 212 [2018-01-29 23:59:42,156 INFO L226 Difference]: Without dead ends: 122 [2018-01-29 23:59:42,157 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-29 23:59:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-01-29 23:59:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 23:59:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-29 23:59:42,188 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 36 [2018-01-29 23:59:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:42,188 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-29 23:59:42,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:59:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-29 23:59:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:59:42,189 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:42,189 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:42,189 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1381654812, now seen corresponding path program 1 times [2018-01-29 23:59:42,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:42,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:42,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:42,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:42,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:42,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:42,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:42,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:42,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:59:42,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:59:42,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:42,386 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 8 states. [2018-01-29 23:59:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:42,701 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-01-29 23:59:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:59:42,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-29 23:59:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:42,702 INFO L225 Difference]: With dead ends: 153 [2018-01-29 23:59:42,702 INFO L226 Difference]: Without dead ends: 152 [2018-01-29 23:59:42,703 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:59:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-29 23:59:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2018-01-29 23:59:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-29 23:59:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-29 23:59:42,717 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 37 [2018-01-29 23:59:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:42,718 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-29 23:59:42,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:59:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-29 23:59:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:59:42,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:42,719 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:42,719 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1381654811, now seen corresponding path program 1 times [2018-01-29 23:59:42,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:42,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:42,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:42,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:42,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:42,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:42,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:42,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-29 23:59:42,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:59:42,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:59:42,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:59:42,930 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 12 states. [2018-01-29 23:59:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:43,533 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-01-29 23:59:43,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:59:43,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-01-29 23:59:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:43,535 INFO L225 Difference]: With dead ends: 161 [2018-01-29 23:59:43,535 INFO L226 Difference]: Without dead ends: 159 [2018-01-29 23:59:43,536 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:59:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-29 23:59:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 112. [2018-01-29 23:59:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 23:59:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-29 23:59:43,546 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 37 [2018-01-29 23:59:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:43,546 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-29 23:59:43,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:59:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-29 23:59:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 23:59:43,547 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:43,547 INFO L350 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] [2018-01-29 23:59:43,548 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1636674378, now seen corresponding path program 1 times [2018-01-29 23:59:43,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:43,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:43,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:43,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:43,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:43,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:43,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:59:43,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:59:43,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:59:43,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:59:43,616 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 4 states. [2018-01-29 23:59:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:43,692 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-01-29 23:59:43,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:59:43,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-29 23:59:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:43,694 INFO L225 Difference]: With dead ends: 136 [2018-01-29 23:59:43,694 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 23:59:43,694 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:59:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 23:59:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-29 23:59:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-29 23:59:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-01-29 23:59:43,710 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 36 [2018-01-29 23:59:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:43,710 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-01-29 23:59:43,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:59:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-01-29 23:59:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:59:43,711 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:43,711 INFO L350 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] [2018-01-29 23:59:43,711 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:43,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1768585567, now seen corresponding path program 1 times [2018-01-29 23:59:43,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:43,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:43,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:43,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:43,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:43,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:43,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:43,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:59:43,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:59:43,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:59:43,779 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 7 states. [2018-01-29 23:59:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:43,852 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-29 23:59:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:59:43,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-29 23:59:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:43,853 INFO L225 Difference]: With dead ends: 114 [2018-01-29 23:59:43,853 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 23:59:43,854 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:59:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 23:59:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-29 23:59:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-29 23:59:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-29 23:59:43,866 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 37 [2018-01-29 23:59:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:43,866 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-29 23:59:43,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:59:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-29 23:59:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:59:43,867 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:43,868 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:43,868 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1942844188, now seen corresponding path program 1 times [2018-01-29 23:59:43,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:43,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:43,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:43,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:43,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:43,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:43,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:59:43,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:59:43,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:59:43,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:59:43,911 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 5 states. [2018-01-29 23:59:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:43,948 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-01-29 23:59:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:59:43,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-29 23:59:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:43,950 INFO L225 Difference]: With dead ends: 153 [2018-01-29 23:59:43,950 INFO L226 Difference]: Without dead ends: 113 [2018-01-29 23:59:43,950 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-29 23:59:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-01-29 23:59:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-29 23:59:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-01-29 23:59:43,964 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 49 [2018-01-29 23:59:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:43,964 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-01-29 23:59:43,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:59:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-01-29 23:59:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:59:43,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:43,965 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:43,965 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash -869979201, now seen corresponding path program 1 times [2018-01-29 23:59:43,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:43,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:43,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:43,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:43,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:59:44,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:59:44,240 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:59:44,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:44,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:59:44,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:59:44,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:59:44,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-29 23:59:44,404 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-29 23:59:44,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-29 23:59:44,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-01-29 23:59:44,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:59:44,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-29 23:59:44,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-29 23:59:44,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-29 23:59:44,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:44,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-29 23:59:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:44,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:59:44,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2018-01-29 23:59:44,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:59:44,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:59:44,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2018-01-29 23:59:44,551 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 19 states. [2018-01-29 23:59:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:44,998 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-01-29 23:59:44,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:59:44,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-01-29 23:59:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:44,999 INFO L225 Difference]: With dead ends: 106 [2018-01-29 23:59:44,999 INFO L226 Difference]: Without dead ends: 105 [2018-01-29 23:59:45,000 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=4, NotChecked=56, Total=930 [2018-01-29 23:59:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-29 23:59:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-29 23:59:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 23:59:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-29 23:59:45,008 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 49 [2018-01-29 23:59:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:45,008 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-29 23:59:45,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:59:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-29 23:59:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:59:45,009 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:45,009 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:45,009 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash -869979200, now seen corresponding path program 1 times [2018-01-29 23:59:45,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:45,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:45,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:45,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:45,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:45,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:45,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:59:45,384 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:59:45,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:45,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:59:45,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:59:45,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:59:45,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:59:45,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:59:45,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-29 23:59:45,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-29 23:59:45,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-29 23:59:45,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:59:45,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:59:45,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:59:45,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:35 [2018-01-29 23:59:45,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-29 23:59:45,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-29 23:59:45,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:45,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-29 23:59:45,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2018-01-29 23:59:45,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:59:45,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:59:45,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:59:45,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:24 [2018-01-29 23:59:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:45,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:59:45,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-01-29 23:59:45,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:59:45,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:59:45,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=431, Unknown=8, NotChecked=0, Total=506 [2018-01-29 23:59:45,739 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 23 states. [2018-01-29 23:59:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:46,326 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-01-29 23:59:46,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:59:46,327 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-01-29 23:59:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:46,327 INFO L225 Difference]: With dead ends: 137 [2018-01-29 23:59:46,327 INFO L226 Difference]: Without dead ends: 136 [2018-01-29 23:59:46,328 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1020, Unknown=13, NotChecked=0, Total=1190 [2018-01-29 23:59:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-29 23:59:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2018-01-29 23:59:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-29 23:59:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-29 23:59:46,343 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 49 [2018-01-29 23:59:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:46,343 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-29 23:59:46,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:59:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-29 23:59:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:59:46,344 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:46,344 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:46,344 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -903876539, now seen corresponding path program 1 times [2018-01-29 23:59:46,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:46,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:46,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:46,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:46,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:46,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:46,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:46,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:46,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:59:46,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:59:46,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:59:46,407 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-01-29 23:59:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:46,600 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-01-29 23:59:46,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:59:46,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-29 23:59:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:46,601 INFO L225 Difference]: With dead ends: 175 [2018-01-29 23:59:46,601 INFO L226 Difference]: Without dead ends: 114 [2018-01-29 23:59:46,602 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:59:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-29 23:59:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-01-29 23:59:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-29 23:59:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-01-29 23:59:46,614 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 50 [2018-01-29 23:59:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:46,615 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-01-29 23:59:46,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:59:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-01-29 23:59:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 23:59:46,615 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:46,616 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:46,616 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1267074650, now seen corresponding path program 1 times [2018-01-29 23:59:46,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:46,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:46,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:46,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:46,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:46,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:59:46,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:46,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:59:46,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:46,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:46,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:46,707 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 6 states. [2018-01-29 23:59:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:46,783 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-29 23:59:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:59:46,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-01-29 23:59:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:46,785 INFO L225 Difference]: With dead ends: 170 [2018-01-29 23:59:46,785 INFO L226 Difference]: Without dead ends: 110 [2018-01-29 23:59:46,786 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-29 23:59:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-01-29 23:59:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-29 23:59:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-01-29 23:59:46,799 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 59 [2018-01-29 23:59:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:46,799 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-01-29 23:59:46,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-01-29 23:59:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 23:59:46,800 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:46,800 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:46,800 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1858760899, now seen corresponding path program 1 times [2018-01-29 23:59:46,801 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:46,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:46,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:46,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:46,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:46,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:59:46,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:59:46,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:59:46,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:46,866 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 6 states. [2018-01-29 23:59:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:47,104 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-29 23:59:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:59:47,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-01-29 23:59:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:47,105 INFO L225 Difference]: With dead ends: 126 [2018-01-29 23:59:47,105 INFO L226 Difference]: Without dead ends: 125 [2018-01-29 23:59:47,106 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-29 23:59:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2018-01-29 23:59:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-29 23:59:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-01-29 23:59:47,123 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 59 [2018-01-29 23:59:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:47,123 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-01-29 23:59:47,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:59:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-01-29 23:59:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 23:59:47,124 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:47,125 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:47,125 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1858760898, now seen corresponding path program 1 times [2018-01-29 23:59:47,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:47,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:47,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:47,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:47,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:47,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:47,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:59:47,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:59:47,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:59:47,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:59:47,181 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 5 states. [2018-01-29 23:59:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:47,243 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-01-29 23:59:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:59:47,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-01-29 23:59:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:47,245 INFO L225 Difference]: With dead ends: 168 [2018-01-29 23:59:47,245 INFO L226 Difference]: Without dead ends: 114 [2018-01-29 23:59:47,245 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:59:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-29 23:59:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-01-29 23:59:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-29 23:59:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-01-29 23:59:47,259 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 59 [2018-01-29 23:59:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:47,260 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-01-29 23:59:47,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:59:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-01-29 23:59:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:59:47,261 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:47,261 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:47,261 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash 212641951, now seen corresponding path program 1 times [2018-01-29 23:59:47,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:47,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:47,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:47,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:47,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:59:47,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:47,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:59:47,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:59:47,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:59:47,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:47,338 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 8 states. [2018-01-29 23:59:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:47,570 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-01-29 23:59:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:59:47,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-29 23:59:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:47,573 INFO L225 Difference]: With dead ends: 119 [2018-01-29 23:59:47,573 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 23:59:47,574 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:59:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 23:59:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-01-29 23:59:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 23:59:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-29 23:59:47,588 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 60 [2018-01-29 23:59:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:47,588 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-29 23:59:47,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:59:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-29 23:59:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:59:47,589 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:47,590 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:47,590 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash 212641952, now seen corresponding path program 1 times [2018-01-29 23:59:47,590 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:47,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:47,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:47,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:47,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-29 23:59:47,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:47,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:59:47,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:59:47,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:59:47,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:59:47,764 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 11 states. [2018-01-29 23:59:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:47,901 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-01-29 23:59:47,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:59:47,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-01-29 23:59:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:47,902 INFO L225 Difference]: With dead ends: 119 [2018-01-29 23:59:47,902 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 23:59:47,902 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:59:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 23:59:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-29 23:59:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 23:59:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-01-29 23:59:47,917 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 60 [2018-01-29 23:59:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:47,918 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-01-29 23:59:47,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:59:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-01-29 23:59:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 23:59:47,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:47,919 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:47,919 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1998034078, now seen corresponding path program 1 times [2018-01-29 23:59:47,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:47,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:47,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:47,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:47,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:48,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:48,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:59:48,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:59:48,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:59:48,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:59:48,109 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 11 states. [2018-01-29 23:59:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:48,478 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-01-29 23:59:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:59:48,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-29 23:59:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:48,480 INFO L225 Difference]: With dead ends: 120 [2018-01-29 23:59:48,480 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 23:59:48,481 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:59:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 23:59:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-01-29 23:59:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 23:59:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-01-29 23:59:48,496 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 61 [2018-01-29 23:59:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:48,496 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-01-29 23:59:48,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:59:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-01-29 23:59:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 23:59:48,497 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:48,497 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:48,498 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1998034079, now seen corresponding path program 1 times [2018-01-29 23:59:48,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:48,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:48,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:48,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:48,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:48,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:48,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:48,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:59:48,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:59:48,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:59:48,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:59:48,671 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 11 states. [2018-01-29 23:59:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:49,112 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-01-29 23:59:49,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:59:49,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-29 23:59:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:49,113 INFO L225 Difference]: With dead ends: 117 [2018-01-29 23:59:49,113 INFO L226 Difference]: Without dead ends: 116 [2018-01-29 23:59:49,114 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:59:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-29 23:59:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-29 23:59:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 23:59:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-01-29 23:59:49,124 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 61 [2018-01-29 23:59:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:49,124 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-01-29 23:59:49,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:59:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-01-29 23:59:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:59:49,125 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:49,125 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:49,126 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1570401144, now seen corresponding path program 1 times [2018-01-29 23:59:49,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:49,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:49,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:49,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:49,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:49,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-29 23:59:49,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:49,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:59:49,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:59:49,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:59:49,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:59:49,215 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 8 states. [2018-01-29 23:59:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:49,308 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2018-01-29 23:59:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:59:49,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-29 23:59:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:49,309 INFO L225 Difference]: With dead ends: 156 [2018-01-29 23:59:49,309 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 23:59:49,309 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:59:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 23:59:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-01-29 23:59:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-29 23:59:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2018-01-29 23:59:49,320 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 60 [2018-01-29 23:59:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:49,320 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2018-01-29 23:59:49,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:59:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-01-29 23:59:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 23:59:49,320 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:49,321 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:49,321 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1690410778, now seen corresponding path program 1 times [2018-01-29 23:59:49,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:49,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:49,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:49,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:49,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:49,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:59:50,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:59:50,195 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:59:50,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:50,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:59:50,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:59:50,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:59:50,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-29 23:59:50,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-01-29 23:59:50,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:50,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-01-29 23:59:50,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-29 23:59:50,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-01-29 23:59:50,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-01-29 23:59:50,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:50,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-01-29 23:59:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:59:50,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:59:50,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-01-29 23:59:50,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 23:59:50,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 23:59:50,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=644, Unknown=21, NotChecked=0, Total=756 [2018-01-29 23:59:50,705 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 28 states. [2018-01-29 23:59:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:51,620 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-01-29 23:59:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:59:51,620 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-01-29 23:59:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:51,621 INFO L225 Difference]: With dead ends: 130 [2018-01-29 23:59:51,621 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 23:59:51,622 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=1357, Unknown=26, NotChecked=0, Total=1560 [2018-01-29 23:59:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 23:59:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-29 23:59:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 23:59:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-29 23:59:51,634 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 62 [2018-01-29 23:59:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:51,634 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-29 23:59:51,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 23:59:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-29 23:59:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 23:59:51,635 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:51,635 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:51,635 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:51,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1105047636, now seen corresponding path program 1 times [2018-01-29 23:59:51,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:51,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:51,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:51,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:51,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:51,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:51,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:59:51,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-29 23:59:51,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:59:51,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:59:51,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:59:51,900 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 13 states. [2018-01-29 23:59:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:59:52,204 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-01-29 23:59:52,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:59:52,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-01-29 23:59:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:59:52,205 INFO L225 Difference]: With dead ends: 98 [2018-01-29 23:59:52,205 INFO L226 Difference]: Without dead ends: 97 [2018-01-29 23:59:52,206 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:59:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-29 23:59:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-29 23:59:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-29 23:59:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-29 23:59:52,214 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 65 [2018-01-29 23:59:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:59:52,214 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-29 23:59:52,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:59:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-29 23:59:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:59:52,214 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:59:52,214 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:59:52,215 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-29 23:59:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash 103261674, now seen corresponding path program 1 times [2018-01-29 23:59:52,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:59:52,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:59:52,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:52,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:52,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:59:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:52,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:59:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:52,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:59:52,910 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:59:52,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:59:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:59:52,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:59:52,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:59:52,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:52,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:52,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:59:52,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:59:52,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:59:52,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:52,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:52,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:52,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-01-29 23:59:53,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:53,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:53,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-01-29 23:59:53,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:53,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-01-29 23:59:53,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:53,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-29 23:59:53,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:53,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:53,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:59:53,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:43 [2018-01-29 23:59:53,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-01-29 23:59:53,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:53,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:59:53,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:26 [2018-01-29 23:59:57,774 WARN L143 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-29 23:59:57,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:57,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-01-29 23:59:57,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:59:57,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:59:57,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:51 [2018-01-29 23:59:57,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-01-29 23:59:57,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:57,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:59:57,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-01-29 23:59:57,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:59:57,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:59:57,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:59:57,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-01-29 23:59:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:59:58,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:59:58,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 35 [2018-01-29 23:59:58,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:59:58,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:59:58,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1144, Unknown=8, NotChecked=0, Total=1260 [2018-01-29 23:59:58,021 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 36 states. [2018-01-30 00:00:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:01,288 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-01-30 00:00:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:00:01,289 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-01-30 00:00:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:01,289 INFO L225 Difference]: With dead ends: 112 [2018-01-30 00:00:01,289 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:00:01,290 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=250, Invalid=2498, Unknown=8, NotChecked=0, Total=2756 [2018-01-30 00:00:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:00:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-01-30 00:00:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 00:00:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-01-30 00:00:01,300 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 66 [2018-01-30 00:00:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:01,300 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-01-30 00:00:01,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:00:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-01-30 00:00:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:00:01,301 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:01,301 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:01,301 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:01,301 INFO L82 PathProgramCache]: Analyzing trace with hash 776927283, now seen corresponding path program 1 times [2018-01-30 00:00:01,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:01,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:01,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:01,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:01,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:00:01,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:01,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:00:01,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:00:01,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:00:01,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:00:01,766 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 10 states. [2018-01-30 00:00:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:02,073 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-01-30 00:00:02,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:00:02,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-01-30 00:00:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:02,074 INFO L225 Difference]: With dead ends: 111 [2018-01-30 00:00:02,074 INFO L226 Difference]: Without dead ends: 110 [2018-01-30 00:00:02,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:00:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-30 00:00:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-01-30 00:00:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-30 00:00:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-30 00:00:02,092 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 67 [2018-01-30 00:00:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:02,092 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-30 00:00:02,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:00:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-30 00:00:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:00:02,093 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:02,093 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:02,094 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash 776927284, now seen corresponding path program 1 times [2018-01-30 00:00:02,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:02,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:02,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:02,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:02,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:02,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:02,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-30 00:00:02,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:00:02,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:00:02,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:00:02,422 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 15 states. [2018-01-30 00:00:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:02,875 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-30 00:00:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:00:02,875 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-01-30 00:00:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:02,876 INFO L225 Difference]: With dead ends: 105 [2018-01-30 00:00:02,876 INFO L226 Difference]: Without dead ends: 104 [2018-01-30 00:00:02,877 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:00:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-30 00:00:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-30 00:00:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-30 00:00:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-01-30 00:00:02,888 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 67 [2018-01-30 00:00:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:02,888 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-01-30 00:00:02,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:00:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-01-30 00:00:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:00:02,889 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:02,889 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:02,889 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1685058029, now seen corresponding path program 1 times [2018-01-30 00:00:02,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:02,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:02,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:02,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:02,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:03,315 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-30 00:00:03,555 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 27 DAG size of output 18 [2018-01-30 00:00:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 00:00:04,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:04,140 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:04,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:04,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:04,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:00:04,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:00:04,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-30 00:00:04,296 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-01-30 00:00:04,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-30 00:00:04,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-01-30 00:00:04,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:04,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-30 00:00:04,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:00:04,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:00:04,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:04,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-30 00:00:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:00:04,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:00:04,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2018-01-30 00:00:04,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 00:00:04,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 00:00:04,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=779, Unknown=1, NotChecked=56, Total=930 [2018-01-30 00:00:04,456 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 31 states. [2018-01-30 00:00:09,539 WARN L146 SmtUtils]: Spent 4128ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-30 00:00:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:09,859 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-01-30 00:00:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:00:09,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-01-30 00:00:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:09,860 INFO L225 Difference]: With dead ends: 112 [2018-01-30 00:00:09,860 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:00:09,861 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=257, Invalid=2000, Unknown=3, NotChecked=92, Total=2352 [2018-01-30 00:00:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:00:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-30 00:00:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:00:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-01-30 00:00:09,876 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 68 [2018-01-30 00:00:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:09,877 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-01-30 00:00:09,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 00:00:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-01-30 00:00:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:00:09,891 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:09,891 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:09,891 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1685058028, now seen corresponding path program 1 times [2018-01-30 00:00:09,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:09,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:09,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:09,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:09,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:09,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:10,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:10,755 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:10,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:10,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:10,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:00:10,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:10,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:00:10,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:00:10,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-30 00:00:10,951 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) f19_~a.offset |f19_#t~ret2.base|))) (= |c_#valid| (store |c_old(#valid)| |f19_#t~ret2.base| 1)))) is different from true [2018-01-30 00:00:10,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-30 00:00:10,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 00:00:10,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 28 [2018-01-30 00:00:10,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:00:10,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:10,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:10,983 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:21 [2018-01-30 00:00:11,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-30 00:00:11,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-01-30 00:00:11,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:11,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:11,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:11,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-01-30 00:00:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:11,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:00:11,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 36 [2018-01-30 00:00:11,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 00:00:11,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 00:00:11,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2018-01-30 00:00:11,166 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 37 states. [2018-01-30 00:00:16,176 WARN L146 SmtUtils]: Spent 4043ms on a formula simplification. DAG size of input: 50 DAG size of output 44 [2018-01-30 00:00:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:16,540 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-01-30 00:00:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:00:16,541 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2018-01-30 00:00:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:16,541 INFO L225 Difference]: With dead ends: 114 [2018-01-30 00:00:16,542 INFO L226 Difference]: Without dead ends: 113 [2018-01-30 00:00:16,542 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=313, Invalid=2658, Unknown=3, NotChecked=106, Total=3080 [2018-01-30 00:00:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-30 00:00:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-01-30 00:00:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:00:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-01-30 00:00:16,555 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 68 [2018-01-30 00:00:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:16,555 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-01-30 00:00:16,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 00:00:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-01-30 00:00:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:00:16,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:16,556 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:16,556 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash -628758251, now seen corresponding path program 1 times [2018-01-30 00:00:16,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:16,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:16,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:16,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:16,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:16,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:00:16,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:16,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:00:16,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:00:16,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:00:16,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:00:16,595 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 5 states. [2018-01-30 00:00:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:16,625 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-01-30 00:00:16,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:00:16,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-01-30 00:00:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:16,627 INFO L225 Difference]: With dead ends: 122 [2018-01-30 00:00:16,627 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 00:00:16,627 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:00:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 00:00:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-30 00:00:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:00:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-01-30 00:00:16,644 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 69 [2018-01-30 00:00:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:16,645 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-01-30 00:00:16,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:00:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-01-30 00:00:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:00:16,646 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:16,646 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:16,646 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash 433831978, now seen corresponding path program 1 times [2018-01-30 00:00:16,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:16,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:16,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:16,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:16,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:16,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:17,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:17,385 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:17,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:17,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:17,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:00:17,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:17,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:00:17,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:00:17,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-30 00:00:17,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-01-30 00:00:17,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:17,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-30 00:00:17,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2018-01-30 00:00:17,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 00:00:17,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:17,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:17,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-30 00:00:22,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:22,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:22,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-30 00:00:22,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:22,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:22,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-30 00:00:22,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-30 00:00:22,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-01-30 00:00:22,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:22,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:22,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:22,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:14 [2018-01-30 00:00:22,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:22,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-30 00:00:22,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:22,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:22,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-30 00:00:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:22,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:22,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-30 00:00:22,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:00:22,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:00:22,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1375, Unknown=5, NotChecked=0, Total=1482 [2018-01-30 00:00:22,702 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 39 states. [2018-01-30 00:00:29,279 WARN L146 SmtUtils]: Spent 2015ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-01-30 00:00:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:48,864 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-01-30 00:00:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 00:00:48,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-01-30 00:00:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:48,865 INFO L225 Difference]: With dead ends: 121 [2018-01-30 00:00:48,866 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 00:00:48,867 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=356, Invalid=4327, Unknown=9, NotChecked=0, Total=4692 [2018-01-30 00:00:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 00:00:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-01-30 00:00:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:00:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-01-30 00:00:48,880 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 72 [2018-01-30 00:00:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:48,881 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-01-30 00:00:48,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:00:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-01-30 00:00:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:00:48,882 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:48,882 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:48,882 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash 433831979, now seen corresponding path program 1 times [2018-01-30 00:00:48,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:48,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:48,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:48,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:48,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:48,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:00:48,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:48,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:00:48,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:00:48,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:00:48,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:00:48,998 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 8 states. [2018-01-30 00:00:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:49,139 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-30 00:00:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:00:49,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-30 00:00:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:49,141 INFO L225 Difference]: With dead ends: 116 [2018-01-30 00:00:49,141 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:00:49,141 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:00:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:00:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-30 00:00:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-30 00:00:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-01-30 00:00:49,158 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 72 [2018-01-30 00:00:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:49,159 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-01-30 00:00:49,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:00:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-01-30 00:00:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-30 00:00:49,159 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:49,160 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:49,160 INFO L371 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash 563889463, now seen corresponding path program 1 times [2018-01-30 00:00:49,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:49,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:49,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:49,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:49,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:49,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:49,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:49,968 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:49,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:50,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:50,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:00:50,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-30 00:00:50,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:00:50,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:00:50,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2018-01-30 00:00:50,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:50,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:50,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-01-30 00:00:50,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-01-30 00:00:50,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:50,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-01-30 00:00:50,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:45 [2018-01-30 00:00:50,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:50,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-01-30 00:00:50,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:50,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-01-30 00:00:50,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-01-30 00:00:50,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:50,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-30 00:00:50,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:50,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:50,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:50,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2018-01-30 00:00:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:50,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:00:50,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-01-30 00:00:50,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-30 00:00:50,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-30 00:00:50,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1756, Unknown=8, NotChecked=0, Total=1892 [2018-01-30 00:00:50,810 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 44 states. [2018-01-30 00:00:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:52,389 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-01-30 00:00:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:00:52,390 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2018-01-30 00:00:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:52,390 INFO L225 Difference]: With dead ends: 118 [2018-01-30 00:00:52,390 INFO L226 Difference]: Without dead ends: 117 [2018-01-30 00:00:52,391 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=3497, Unknown=8, NotChecked=0, Total=3782 [2018-01-30 00:00:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-30 00:00:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-01-30 00:00:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:00:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-01-30 00:00:52,408 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 73 [2018-01-30 00:00:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:52,408 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-01-30 00:00:52,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-30 00:00:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-01-30 00:00:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-30 00:00:52,409 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:52,409 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:52,409 INFO L371 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash 563889462, now seen corresponding path program 1 times [2018-01-30 00:00:52,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:52,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:52,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:52,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:52,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:52,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:00:52,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:00:52,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-30 00:00:52,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:00:52,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:00:52,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:00:52,582 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 15 states. [2018-01-30 00:00:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:00:52,778 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-30 00:00:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:00:52,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-01-30 00:00:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:00:52,779 INFO L225 Difference]: With dead ends: 116 [2018-01-30 00:00:52,779 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:00:52,779 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:00:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:00:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-30 00:00:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-30 00:00:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-01-30 00:00:52,792 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 73 [2018-01-30 00:00:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:00:52,792 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-01-30 00:00:52,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:00:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-01-30 00:00:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 00:00:52,793 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:00:52,793 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:00:52,793 INFO L371 AbstractCegarLoop]: === Iteration 39 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:00:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash 441242382, now seen corresponding path program 1 times [2018-01-30 00:00:52,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:00:52,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:00:52,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:52,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:52,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:00:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:52,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:00:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:00:53,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:00:53,195 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:00:53,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:00:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:00:53,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:00:53,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:00:53,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:00:53,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 00:00:53,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 00:00:53,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-30 00:00:53,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:53,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:53,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:00:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-01-30 00:00:53,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:00:53,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-30 00:00:53,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:53,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:36 [2018-01-30 00:00:53,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 00:00:53,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:53,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:53,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:22 [2018-01-30 00:00:55,546 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_probe_unsafe_19_~a.offset_BEFORE_CALL_14 Int) (v_probe_unsafe_19_~a.base_BEFORE_CALL_17 Int) (f19_~a.offset Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| v_probe_unsafe_19_~a.base_BEFORE_CALL_17))) (and (<= f19_~a.offset v_probe_unsafe_19_~a.offset_BEFORE_CALL_14) (not (= v_probe_unsafe_19_~a.base_BEFORE_CALL_17 (select .cse0 f19_~a.offset))) (not (= 0 (select .cse0 (+ v_probe_unsafe_19_~a.offset_BEFORE_CALL_14 4))))))) is different from true [2018-01-30 00:00:55,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-30 00:00:55,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:00:55,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:00:55,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:22 [2018-01-30 00:01:05,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-01-30 00:01:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:01:05,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-01-30 00:01:05,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:05,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:01:05,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:01:05,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:15 [2018-01-30 00:01:06,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:01:06,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-01-30 00:01:06,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 00:01:06,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:01:06,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-01-30 00:01:06,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:01:06,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:01:06,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-01-30 00:01:06,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:06,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:01:06,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:15 [2018-01-30 00:01:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:01:06,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:06,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 35 [2018-01-30 00:01:06,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 00:01:06,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 00:01:06,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1076, Unknown=15, NotChecked=66, Total=1260 [2018-01-30 00:01:06,414 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 36 states. [2018-01-30 00:01:38,563 WARN L143 SmtUtils]: Spent 610ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-30 00:01:39,580 WARN L143 SmtUtils]: Spent 973ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-30 00:01:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:39,816 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-30 00:01:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:01:39,816 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-01-30 00:01:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:39,817 INFO L225 Difference]: With dead ends: 116 [2018-01-30 00:01:39,817 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:01:39,817 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=276, Invalid=2785, Unknown=23, NotChecked=108, Total=3192 [2018-01-30 00:01:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:01:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-01-30 00:01:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:01:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-01-30 00:01:39,828 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 77 [2018-01-30 00:01:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:39,828 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-01-30 00:01:39,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:01:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-01-30 00:01:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-30 00:01:39,829 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:39,829 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:01:39,829 INFO L371 AbstractCegarLoop]: === Iteration 40 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-01-30 00:01:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 793611929, now seen corresponding path program 1 times [2018-01-30 00:01:39,829 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:39,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:39,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:39,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:39,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:01:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:01:39,882 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:01:39,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:01:39 BoogieIcfgContainer [2018-01-30 00:01:39,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:01:39,929 INFO L168 Benchmark]: Toolchain (without parser) took 123139.52 ms. Allocated memory was 309.3 MB in the beginning and 714.1 MB in the end (delta: 404.8 MB). Free memory was 268.2 MB in the beginning and 598.1 MB in the end (delta: -329.9 MB). Peak memory consumption was 74.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:01:39,931 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 309.3 MB. Free memory is still 275.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:01:39,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.31 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 254.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:01:39,931 INFO L168 Benchmark]: Boogie Preprocessor took 33.06 ms. Allocated memory is still 309.3 MB. Free memory was 254.2 MB in the beginning and 253.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-30 00:01:39,932 INFO L168 Benchmark]: RCFGBuilder took 338.01 ms. Allocated memory is still 309.3 MB. Free memory was 253.3 MB in the beginning and 226.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:01:39,932 INFO L168 Benchmark]: TraceAbstraction took 122544.61 ms. Allocated memory was 309.3 MB in the beginning and 714.1 MB in the end (delta: 404.8 MB). Free memory was 226.9 MB in the beginning and 598.1 MB in the end (delta: -371.2 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:01:39,934 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 309.3 MB. Free memory is still 275.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.31 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 254.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.06 ms. Allocated memory is still 309.3 MB. Free memory was 254.2 MB in the beginning and 253.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 338.01 ms. Allocated memory is still 309.3 MB. Free memory was 253.3 MB in the beginning and 226.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 122544.61 ms. Allocated memory was 309.3 MB in the beginning and 714.1 MB in the end (delta: 404.8 MB). Free memory was 226.9 MB in the beginning and 598.1 MB in the end (delta: -371.2 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; VAL [a19={13:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={13:0}] [L1455] int ret = - -3; VAL [a={13:0}, a={13:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={11:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={11:0}, malloc(size)={11:0}, size=4] [L1457] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}, ret=3] [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}, ret=3] [L1458] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=3] [L1458] COND FALSE !(!a->q) VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=3] [L1460] CALL, EXPR f19(a) VAL [a={13:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={10:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={10:0}, malloc(size)={10:0}, size=4] [L1440] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}] [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}] [L1441] FCALL a->p VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1441] COND TRUE a->p VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1442] RET return 0; VAL [\result=0, a={13:0}, a={13:0}] [L1460] EXPR f19(a) VAL [a={13:0}, a={13:0}, f19(a)=0, ret=3] [L1460] ret = f19(a) VAL [a={13:0}, a={13:0}, f19(a)=0, ret=0] [L1461] COND FALSE !(\read(ret)) VAL [a={13:0}, a={13:0}, ret=0] [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0] [L1464] EXPR g19() VAL [a={13:0}, a={13:0}, g19()=0, ret=0] [L1464] COND TRUE !g19() VAL [a={13:0}, a={13:0}, g19()=0, ret=0] [L1470] CALL f19_undo(a) VAL [a={13:0}] [L1447] EXPR, FCALL a->p VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1447] RET, FCALL free(a->p) VAL [a={13:0}, a={13:0}, a->p={10:0}] [L1470] f19_undo(a) VAL [a={13:0}, a={13:0}, ret=0] [L1472] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=0] [L1472] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={11:0}, ret=0] [L1474] RET return ret; VAL [\result=0, a={13:0}, a={13:0}, ret=0] [L1484] EXPR probe_unsafe_19(&a19) VAL [a19={13:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); VAL [a19={13:0}, probe_unsafe_19(&a19)=0, ret=0] [L1486] COND TRUE ret==0 VAL [a19={13:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={13:0}] [L1478] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={11:0}] [L1478] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 110 locations, 21 error locations. UNSAFE Result, 122.4s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 84.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3393 SDtfs, 3725 SDslu, 18555 SDs, 0 SdLazy, 15383 SolverSat, 898 SolverUnsat, 154 SolverUnknown, 0 SolverNotchecked, 60.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 551 SyntacticMatches, 36 SemanticMatches, 734 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5816 ImplicationChecksByTransitivity, 53.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 562 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 2712 NumberOfCodeBlocks, 2712 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2585 ConstructedInterpolants, 151 QuantifiedInterpolants, 1470797 SizeOfPredicates, 118 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 49 InterpolantComputations, 34 PerfectInterpolantSequences, 221/284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-01-39-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-01-39-941.csv Received shutdown request...