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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:00:02,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:00:02,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:00:02,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:00:02,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:00:02,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:00:02,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:00:02,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:00:02,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:00:02,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:00:02,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:00:02,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:00:02,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:00:02,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:00:02,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:00:02,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:00:02,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:00:02,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:00:02,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:00:02,800 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:00:02,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:00:02,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:00:02,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:00:02,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:00:02,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:00:02,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:00:02,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:00:02,804 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:00:02,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:00:02,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:00:02,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:00:02,805 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:00:02,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:00:02,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:00:02,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:00:02,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:00:02,812 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:00:02,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:00:02,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:00:02,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:00:02,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:00:02,814 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:00:02,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:00:02,846 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:00:02,850 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:00:02,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:00:02,852 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:00:02,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-02-04 19:00:03,011 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:00:03,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:00:03,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:00:03,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:00:03,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:00:03,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812d57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03, skipping insertion in model container [2018-02-04 19:00:03,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,029 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:00:03,063 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:00:03,151 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:00:03,166 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:00:03,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03 WrapperNode [2018-02-04 19:00:03,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:00:03,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:00:03,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:00:03,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:00:03,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... [2018-02-04 19:00:03,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:00:03,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:00:03,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:00:03,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:00:03,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 19:00:03,239 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:00:03,239 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:00:03,240 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:00:03,240 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:00:03,241 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:00:03,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:00:03,243 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:00:03,428 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:00:03,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:00:03 BoogieIcfgContainer [2018-02-04 19:00:03,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:00:03,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:00:03,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:00:03,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:00:03,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:00:03" (1/3) ... [2018-02-04 19:00:03,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dd727b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:00:03, skipping insertion in model container [2018-02-04 19:00:03,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:00:03" (2/3) ... [2018-02-04 19:00:03,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dd727b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:00:03, skipping insertion in model container [2018-02-04 19:00:03,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:00:03" (3/3) ... [2018-02-04 19:00:03,433 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-02-04 19:00:03,439 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:00:03,443 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 19:00:03,473 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:00:03,473 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:00:03,473 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:00:03,473 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:00:03,473 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:00:03,473 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:00:03,474 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:00:03,474 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:00:03,474 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:00:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-04 19:00:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 19:00:03,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:03,496 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:03,496 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-02-04 19:00:03,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045335, now seen corresponding path program 1 times [2018-02-04 19:00:03,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:03,502 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:03,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:03,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:03,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:03,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:03,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:03,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:00:03,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:00:03,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:00:03,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:00:03,727 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-04 19:00:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:04,013 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-04 19:00:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:00:04,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 19:00:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:04,026 INFO L225 Difference]: With dead ends: 136 [2018-02-04 19:00:04,026 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 19:00:04,028 INFO L554 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-02-04 19:00:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 19:00:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-04 19:00:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:00:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-04 19:00:04,063 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-04 19:00:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:04,063 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-04 19:00:04,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:00:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-04 19:00:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 19:00:04,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:04,065 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:04,065 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-02-04 19:00:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045336, now seen corresponding path program 1 times [2018-02-04 19:00:04,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:04,065 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:04,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:04,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:04,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:04,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:04,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:04,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:00:04,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:00:04,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:00:04,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:00:04,153 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-04 19:00:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:04,392 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-04 19:00:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:00:04,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 19:00:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:04,394 INFO L225 Difference]: With dead ends: 126 [2018-02-04 19:00:04,394 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 19:00:04,395 INFO L554 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-02-04 19:00:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 19:00:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-04 19:00:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 19:00:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-04 19:00:04,403 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-04 19:00:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:04,404 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-04 19:00:04,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:00:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-04 19:00:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:00:04,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:04,405 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:04,405 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-02-04 19:00:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432345, now seen corresponding path program 1 times [2018-02-04 19:00:04,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:04,405 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:04,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:04,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:04,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:04,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:04,431 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:04,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:04,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:04,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:04,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:04,487 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-02-04 19:00:04,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:00:04,504 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:00:04,511 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 12 treesize of output 11 [2018-02-04 19:00:04,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,514 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-02-04 19:00:04,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:00:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:04,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:04,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:00:04,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:00:04,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:00:04,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-02-04 19:00:04,520 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 7 states. [2018-02-04 19:00:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:04,659 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2018-02-04 19:00:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:00:04,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 19:00:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:04,660 INFO L225 Difference]: With dead ends: 130 [2018-02-04 19:00:04,660 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 19:00:04,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2018-02-04 19:00:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 19:00:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2018-02-04 19:00:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:00:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 19:00:04,668 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 17 [2018-02-04 19:00:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:04,668 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 19:00:04,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:00:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 19:00:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:00:04,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:04,669 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:04,669 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-02-04 19:00:04,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432346, now seen corresponding path program 1 times [2018-02-04 19:00:04,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:04,669 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:04,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:04,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:04,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:04,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:04,688 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:04,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:04,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:04,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:04,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:04,717 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-02-04 19:00:04,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,721 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-02-04 19:00:04,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:00:04,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 35 [2018-02-04 19:00:04,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,821 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 31 treesize of output 25 [2018-02-04 19:00:04,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,837 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 34 treesize of output 47 [2018-02-04 19:00:04,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:04,860 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 33 treesize of output 27 [2018-02-04 19:00:04,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:04,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:00:04,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-04 19:00:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:04,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:04,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:00:04,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:00:04,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:00:04,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:00:04,908 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 8 states. [2018-02-04 19:00:20,108 WARN L143 SmtUtils]: Spent 12100ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 19:00:42,863 WARN L146 SmtUtils]: Spent 22406ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-02-04 19:00:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:51,345 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-04 19:00:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:00:51,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 19:00:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:51,346 INFO L225 Difference]: With dead ends: 149 [2018-02-04 19:00:51,346 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 19:00:51,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=38, Invalid=116, Unknown=2, NotChecked=0, Total=156 [2018-02-04 19:00:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 19:00:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 92. [2018-02-04 19:00:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:00:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-02-04 19:00:51,354 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 17 [2018-02-04 19:00:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:51,354 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-02-04 19:00:51,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:00:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-02-04 19:00:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:00:51,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:51,359 INFO L351 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] [2018-02-04 19:00:51,359 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-02-04 19:00:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash 522081757, now seen corresponding path program 1 times [2018-02-04 19:00:51,359 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:51,359 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:51,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:51,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:51,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:00:51,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:51,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:51,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:51,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:51,428 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-02-04 19:00:51,430 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-02-04 19:00:51,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,438 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-02-04 19:00:51,440 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-02-04 19:00:51,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,443 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-02-04 19:00:51,449 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-02-04 19:00:51,450 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-02-04 19:00:51,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,455 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-02-04 19:00:51,457 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-02-04 19:00:51,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:51,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-02-04 19:00:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:51,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:51,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-02-04 19:00:51,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:00:51,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:00:51,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:00:51,465 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 6 states. [2018-02-04 19:00:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:51,495 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-04 19:00:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:00:51,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:00:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:51,497 INFO L225 Difference]: With dead ends: 99 [2018-02-04 19:00:51,497 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 19:00:51,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:00:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 19:00:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-02-04 19:00:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 19:00:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2018-02-04 19:00:51,503 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 26 [2018-02-04 19:00:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:51,503 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2018-02-04 19:00:51,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:00:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2018-02-04 19:00:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:00:51,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:51,504 INFO L351 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] [2018-02-04 19:00:51,504 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-02-04 19:00:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386785, now seen corresponding path program 1 times [2018-02-04 19:00:51,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:51,504 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:51,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:51,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:51,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:51,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:51,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:00:51,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:00:51,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:00:51,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:00:51,571 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 8 states. [2018-02-04 19:00:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:51,679 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-02-04 19:00:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:00:51,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 19:00:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:51,680 INFO L225 Difference]: With dead ends: 109 [2018-02-04 19:00:51,680 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 19:00:51,680 INFO L554 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-02-04 19:00:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 19:00:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-02-04 19:00:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 19:00:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-02-04 19:00:51,685 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 26 [2018-02-04 19:00:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:51,685 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-02-04 19:00:51,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:00:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-02-04 19:00:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:00:51,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:51,686 INFO L351 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] [2018-02-04 19:00:51,686 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-02-04 19:00:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386784, now seen corresponding path program 1 times [2018-02-04 19:00:51,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:51,686 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:51,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:51,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:51,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:51,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:51,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:00:51,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:00:51,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:00:51,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:00:51,718 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 6 states. [2018-02-04 19:00:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:51,737 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2018-02-04 19:00:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:00:51,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 19:00:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:51,738 INFO L225 Difference]: With dead ends: 105 [2018-02-04 19:00:51,738 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 19:00:51,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:00:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 19:00:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-02-04 19:00:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 19:00:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-04 19:00:51,741 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 26 [2018-02-04 19:00:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:51,742 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-04 19:00:51,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:00:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-04 19:00:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:00:51,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:51,742 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:00:51,742 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-02-04 19:00:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1338867621, now seen corresponding path program 1 times [2018-02-04 19:00:51,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:51,742 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:51,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:51,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:51,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:51,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:51,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:00:51,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:00:51,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:00:51,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:00:51,800 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-02-04 19:00:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:51,954 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-02-04 19:00:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:00:51,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 19:00:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:51,955 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:00:51,955 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:00:51,955 INFO L554 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-02-04 19:00:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:00:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-04 19:00:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 19:00:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2018-02-04 19:00:51,958 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 28 [2018-02-04 19:00:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:51,958 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2018-02-04 19:00:51,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:00:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2018-02-04 19:00:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:00:51,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:51,958 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:00:51,959 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-02-04 19:00:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1338867620, now seen corresponding path program 1 times [2018-02-04 19:00:51,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:51,959 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:51,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:51,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:51,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:52,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:52,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:00:52,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:00:52,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:00:52,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:00:52,033 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 9 states. [2018-02-04 19:00:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:52,226 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-02-04 19:00:52,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:00:52,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 19:00:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:52,227 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:00:52,227 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:00:52,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:00:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:00:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-04 19:00:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 19:00:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-02-04 19:00:52,232 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 28 [2018-02-04 19:00:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:52,232 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-02-04 19:00:52,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:00:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-02-04 19:00:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 19:00:52,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:52,233 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:00:52,233 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-02-04 19:00:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755101, now seen corresponding path program 1 times [2018-02-04 19:00:52,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:52,234 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:52,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:52,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:52,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:52,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:52,245 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:52,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:52,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:52,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:52,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:52,298 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:00:52,304 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 12 treesize of output 11 [2018-02-04 19:00:52,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,307 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-02-04 19:00:52,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:00:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:52,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:52,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:00:52,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:00:52,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:00:52,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-02-04 19:00:52,313 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-02-04 19:00:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:52,442 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-02-04 19:00:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:00:52,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 19:00:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:52,445 INFO L225 Difference]: With dead ends: 108 [2018-02-04 19:00:52,445 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 19:00:52,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-02-04 19:00:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 19:00:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2018-02-04 19:00:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 19:00:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 19:00:52,449 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 30 [2018-02-04 19:00:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:52,449 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 19:00:52,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:00:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 19:00:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 19:00:52,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:52,457 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:00:52,457 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-02-04 19:00:52,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755102, now seen corresponding path program 1 times [2018-02-04 19:00:52,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:52,458 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:52,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:52,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:52,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:52,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:52,471 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:52,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:52,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:52,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:52,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:52,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 37 [2018-02-04 19:00:52,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,709 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 49 [2018-02-04 19:00:52,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-04 19:00:52,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:52,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:00:52,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:00:52,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:71, output treesize:53 [2018-02-04 19:00:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:00:52,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:52,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:00:52,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:00:52,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:00:52,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:00:52,879 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 11 states. [2018-02-04 19:01:07,313 WARN L143 SmtUtils]: Spent 12096ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 19:01:27,529 WARN L146 SmtUtils]: Spent 20189ms on a formula simplification. DAG size of input: 55 DAG size of output 55 [2018-02-04 19:01:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:27,579 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-04 19:01:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:01:27,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 19:01:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:27,580 INFO L225 Difference]: With dead ends: 115 [2018-02-04 19:01:27,580 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 19:01:27,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:01:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 19:01:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-02-04 19:01:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:01:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-02-04 19:01:27,583 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 30 [2018-02-04 19:01:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:27,583 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-02-04 19:01:27,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:01:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-02-04 19:01:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:01:27,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:27,584 INFO L351 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] [2018-02-04 19:01:27,584 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-02-04 19:01:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1057519410, now seen corresponding path program 1 times [2018-02-04 19:01:27,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:27,584 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:27,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:27,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:27,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:27,593 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:27,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:27,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:27,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:27,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:27,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:27,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:01:27,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:01:27,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:01:27,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:01:27,637 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 5 states. [2018-02-04 19:01:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:27,703 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-02-04 19:01:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:01:27,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 19:01:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:27,703 INFO L225 Difference]: With dead ends: 107 [2018-02-04 19:01:27,703 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:01:27,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:01:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:01:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 19:01:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 19:01:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 19:01:27,705 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 28 [2018-02-04 19:01:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:27,706 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 19:01:27,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:01:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 19:01:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 19:01:27,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:27,708 INFO L351 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] [2018-02-04 19:01:27,708 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-02-04 19:01:27,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1571490764, now seen corresponding path program 1 times [2018-02-04 19:01:27,708 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:27,709 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:27,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,709 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:27,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:27,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:27,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:27,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:01:27,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:01:27,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:01:27,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:01:27,740 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 7 states. [2018-02-04 19:01:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:27,784 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 19:01:27,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:01:27,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 19:01:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:27,785 INFO L225 Difference]: With dead ends: 88 [2018-02-04 19:01:27,785 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 19:01:27,785 INFO L554 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-02-04 19:01:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 19:01:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 19:01:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 19:01:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-04 19:01:27,788 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 30 [2018-02-04 19:01:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:27,789 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-04 19:01:27,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:01:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-04 19:01:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:01:27,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:27,790 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:27,790 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-02-04 19:01:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1767360087, now seen corresponding path program 1 times [2018-02-04 19:01:27,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:27,790 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:27,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:27,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:27,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:01:27,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:27,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:27,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:01:27,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:01:27,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:01:27,819 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-02-04 19:01:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:27,831 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-04 19:01:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:01:27,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 19:01:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:27,832 INFO L225 Difference]: With dead ends: 105 [2018-02-04 19:01:27,833 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 19:01:27,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:01:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 19:01:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2018-02-04 19:01:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:01:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-02-04 19:01:27,836 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 37 [2018-02-04 19:01:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:27,836 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-02-04 19:01:27,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:01:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-02-04 19:01:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:01:27,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:27,837 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:27,837 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-02-04 19:01:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103528, now seen corresponding path program 1 times [2018-02-04 19:01:27,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:27,838 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:27,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:27,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:27,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:27,849 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:27,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:27,850 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:27,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:27,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:27,886 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-02-04 19:01:27,888 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-02-04 19:01:27,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 19:01:27,925 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.base Int) (|f19_#t~ret2.offset| Int) (f19_~a.offset Int)) (and (<= f19_~a.offset |c_f19_#in~a.offset|) (= (store |c_old(#memory_$Pointer$.offset)| f19_~a.base (store (select |c_old(#memory_$Pointer$.offset)| f19_~a.base) f19_~a.offset |f19_#t~ret2.offset|)) |c_#memory_$Pointer$.offset|))) is different from true [2018-02-04 19:01:27,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 19:01:27,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 22 treesize of output 21 [2018-02-04 19:01:27,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:9 [2018-02-04 19:01:27,961 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-02-04 19:01:27,962 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-02-04 19:01:27,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:27,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 19:01:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:01:27,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:01:27,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 19:01:27,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:01:27,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:01:27,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2018-02-04 19:01:27,970 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 10 states. [2018-02-04 19:01:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,124 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-04 19:01:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:01:28,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 19:01:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:28,125 INFO L225 Difference]: With dead ends: 104 [2018-02-04 19:01:28,125 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 19:01:28,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2018-02-04 19:01:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 19:01:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 19:01:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 19:01:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-02-04 19:01:28,128 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 37 [2018-02-04 19:01:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:28,129 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-02-04 19:01:28,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:01:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-02-04 19:01:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:01:28,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:28,129 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:28,130 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-02-04 19:01:28,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103527, now seen corresponding path program 1 times [2018-02-04 19:01:28,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:28,130 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:28,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,131 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:28,141 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:28,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:28,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:28,142 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:28,167 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-02-04 19:01:28,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:01:28,182 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-02-04 19:01:28,184 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-02-04 19:01:28,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-04 19:01:28,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 19:01:28,267 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 24 treesize of output 23 [2018-02-04 19:01:28,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2018-02-04 19:01:28,288 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-02-04 19:01:28,289 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-02-04 19:01:28,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:01:28,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-04 19:01:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:28,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:01:28,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 19:01:28,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:01:28,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:01:28,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=84, Unknown=3, NotChecked=0, Total=110 [2018-02-04 19:01:28,302 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 11 states. [2018-02-04 19:01:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,532 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2018-02-04 19:01:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:01:28,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-04 19:01:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:28,533 INFO L225 Difference]: With dead ends: 113 [2018-02-04 19:01:28,533 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 19:01:28,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=144, Unknown=3, NotChecked=0, Total=182 [2018-02-04 19:01:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 19:01:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-02-04 19:01:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 19:01:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-02-04 19:01:28,537 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 37 [2018-02-04 19:01:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:28,537 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-02-04 19:01:28,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:01:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-02-04 19:01:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:01:28,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:28,538 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:28,538 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-02-04 19:01:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1112399529, now seen corresponding path program 1 times [2018-02-04 19:01:28,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:28,539 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:28,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:01:28,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:28,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:28,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:28,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:28,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:28,574 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 6 states. [2018-02-04 19:01:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,607 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-02-04 19:01:28,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:01:28,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-04 19:01:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:28,607 INFO L225 Difference]: With dead ends: 102 [2018-02-04 19:01:28,608 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 19:01:28,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 19:01:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 19:01:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 19:01:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-02-04 19:01:28,610 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 38 [2018-02-04 19:01:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:28,610 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-02-04 19:01:28,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-02-04 19:01:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:01:28,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:28,611 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:28,611 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-02-04 19:01:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash -124647017, now seen corresponding path program 1 times [2018-02-04 19:01:28,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:28,611 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:28,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,612 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:01:28,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:28,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:01:28,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:01:28,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:01:28,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:01:28,658 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 7 states. [2018-02-04 19:01:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,684 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-02-04 19:01:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:01:28,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 19:01:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:28,685 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:01:28,685 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:01:28,685 INFO L554 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-02-04 19:01:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:01:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 19:01:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:01:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2018-02-04 19:01:28,688 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 39 [2018-02-04 19:01:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:28,688 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2018-02-04 19:01:28,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:01:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2018-02-04 19:01:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 19:01:28,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:28,689 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:28,689 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-02-04 19:01:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023878, now seen corresponding path program 1 times [2018-02-04 19:01:28,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:28,690 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:28,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,691 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,691 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:28,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:28,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:28,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:28,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:28,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:28,732 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand 6 states. [2018-02-04 19:01:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,829 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-02-04 19:01:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:01:28,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 19:01:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:28,830 INFO L225 Difference]: With dead ends: 111 [2018-02-04 19:01:28,830 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 19:01:28,830 INFO L554 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-02-04 19:01:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 19:01:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-02-04 19:01:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 19:01:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-02-04 19:01:28,833 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 44 [2018-02-04 19:01:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:28,834 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-02-04 19:01:28,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-02-04 19:01:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 19:01:28,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:28,835 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:28,835 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-02-04 19:01:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023877, now seen corresponding path program 1 times [2018-02-04 19:01:28,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:28,835 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:28,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:01:28,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:28,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:01:28,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:01:28,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:01:28,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:01:28,889 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 6 states. [2018-02-04 19:01:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,952 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-02-04 19:01:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:01:28,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 19:01:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:28,954 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:01:28,954 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:01:28,954 INFO L554 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-02-04 19:01:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:01:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 19:01:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 19:01:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-02-04 19:01:28,956 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 44 [2018-02-04 19:01:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:28,957 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-02-04 19:01:28,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:01:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-02-04 19:01:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 19:01:28,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:28,957 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:28,957 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-02-04 19:01:28,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1813582502, now seen corresponding path program 1 times [2018-02-04 19:01:28,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:28,958 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:28,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,959 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:28,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:28,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:01:28,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:28,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:01:28,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:01:28,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:01:28,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:01:28,984 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 5 states. [2018-02-04 19:01:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:28,999 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-02-04 19:01:28,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:01:28,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-04 19:01:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:29,000 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:01:29,000 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:01:29,000 INFO L554 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-02-04 19:01:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:01:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-02-04 19:01:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 19:01:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-02-04 19:01:29,002 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 44 [2018-02-04 19:01:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:29,002 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-02-04 19:01:29,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:01:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-02-04 19:01:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:01:29,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:29,003 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 19:01:29,003 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-02-04 19:01:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 182043132, now seen corresponding path program 1 times [2018-02-04 19:01:29,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:29,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:29,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:01:29,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:29,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:01:29,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:01:29,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:01:29,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:01:29,049 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-02-04 19:01:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:29,124 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-02-04 19:01:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:01:29,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 19:01:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:29,126 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:01:29,126 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:01:29,126 INFO L554 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-02-04 19:01:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:01:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-02-04 19:01:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 19:01:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-04 19:01:29,128 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 46 [2018-02-04 19:01:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:29,128 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-04 19:01:29,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:01:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-04 19:01:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:01:29,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:29,128 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 19:01:29,128 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-02-04 19:01:29,129 INFO L82 PathProgramCache]: Analyzing trace with hash 182043133, now seen corresponding path program 1 times [2018-02-04 19:01:29,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:29,129 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:29,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:01:29,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:29,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:01:29,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:01:29,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:01:29,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:01:29,253 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 11 states. [2018-02-04 19:01:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:29,345 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-04 19:01:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:01:29,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-04 19:01:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:29,346 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:01:29,346 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:01:29,346 INFO L554 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-02-04 19:01:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:01:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 19:01:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:01:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 19:01:29,349 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 46 [2018-02-04 19:01:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:29,349 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 19:01:29,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:01:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 19:01:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:01:29,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:29,350 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:29,350 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-02-04 19:01:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369820, now seen corresponding path program 1 times [2018-02-04 19:01:29,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:29,350 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:29,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:01:29,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:29,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:01:29,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:01:29,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:01:29,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:01:29,429 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 11 states. [2018-02-04 19:01:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:29,552 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 19:01:29,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:01:29,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 19:01:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:29,553 INFO L225 Difference]: With dead ends: 96 [2018-02-04 19:01:29,553 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 19:01:29,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:01:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 19:01:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-02-04 19:01:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:01:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-02-04 19:01:29,555 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 47 [2018-02-04 19:01:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:29,556 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-02-04 19:01:29,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:01:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-02-04 19:01:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:01:29,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:29,556 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:29,557 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-02-04 19:01:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369821, now seen corresponding path program 1 times [2018-02-04 19:01:29,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:29,557 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:29,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:01:29,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:29,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:01:29,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:01:29,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:01:29,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:01:29,666 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 11 states. [2018-02-04 19:01:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:29,849 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-04 19:01:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:01:29,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 19:01:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:29,850 INFO L225 Difference]: With dead ends: 97 [2018-02-04 19:01:29,850 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 19:01:29,850 INFO L554 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-02-04 19:01:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 19:01:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 19:01:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:01:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-04 19:01:29,852 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 47 [2018-02-04 19:01:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:29,852 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-04 19:01:29,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:01:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-04 19:01:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:01:29,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:29,853 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:29,853 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-02-04 19:01:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash -32858344, now seen corresponding path program 1 times [2018-02-04 19:01:29,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:29,853 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:29,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:29,865 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:29,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:29,865 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:29,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:01:29,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:29,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:01:29,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:01:29,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:01:29,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:01:29,902 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 8 states. [2018-02-04 19:01:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:29,923 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-02-04 19:01:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:01:29,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 19:01:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:29,928 INFO L225 Difference]: With dead ends: 105 [2018-02-04 19:01:29,928 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 19:01:29,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:01:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 19:01:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-02-04 19:01:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 19:01:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-02-04 19:01:29,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 46 [2018-02-04 19:01:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:29,931 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-02-04 19:01:29,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:01:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-02-04 19:01:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 19:01:29,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:29,932 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:29,932 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-02-04 19:01:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash -301259047, now seen corresponding path program 1 times [2018-02-04 19:01:29,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:29,932 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:29,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,933 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:29,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:29,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:01:30,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:30,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:01:30,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:01:30,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:01:30,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:01:30,000 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 10 states. [2018-02-04 19:01:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:01:30,143 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-04 19:01:30,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:01:30,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-02-04 19:01:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:01:30,144 INFO L225 Difference]: With dead ends: 113 [2018-02-04 19:01:30,144 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 19:01:30,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:01:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 19:01:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-02-04 19:01:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:01:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-02-04 19:01:30,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 50 [2018-02-04 19:01:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:01:30,147 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-02-04 19:01:30,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:01:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-02-04 19:01:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 19:01:30,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:01:30,148 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:01:30,148 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-02-04 19:01:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash -301259046, now seen corresponding path program 1 times [2018-02-04 19:01:30,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:01:30,148 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:01:30,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:30,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:30,149 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:01:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:30,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:01:30,161 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:01:30,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:01:30,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:01:30,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:01:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:01:30,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:01:30,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:30,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 34 [2018-02-04 19:01:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:30,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:30,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:30,420 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 30 treesize of output 24 [2018-02-04 19:01:30,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:30,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:30,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 36 [2018-02-04 19:01:30,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:30,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:30,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:01:30,462 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 32 treesize of output 26 [2018-02-04 19:01:30,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:01:30,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:01:30,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2018-02-04 19:01:31,397 WARN L143 SmtUtils]: Spent 735ms on a formula simplification that was a NOOP. DAG size: 35 [2018-02-04 19:01:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:01:31,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:01:31,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 19:01:31,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:01:31,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:01:31,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=196, Unknown=2, NotChecked=0, Total=240 [2018-02-04 19:01:31,523 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 16 states. [2018-02-04 19:02:00,736 WARN L143 SmtUtils]: Spent 2113ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-04 19:02:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:03,026 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-04 19:02:03,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:02:03,026 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-02-04 19:02:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:03,026 INFO L225 Difference]: With dead ends: 109 [2018-02-04 19:02:03,027 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 19:02:03,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=113, Invalid=637, Unknown=6, NotChecked=0, Total=756 [2018-02-04 19:02:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 19:02:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-04 19:02:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 19:02:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 19:02:03,028 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 50 [2018-02-04 19:02:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:03,029 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 19:02:03,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:02:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 19:02:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:02:03,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:03,029 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:03,030 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-02-04 19:02:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1444311673, now seen corresponding path program 1 times [2018-02-04 19:02:03,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:03,030 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:03,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:03,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:03,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:03,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:03,040 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:03,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:03,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:03,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:03,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:03,086 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-02-04 19:02:03,088 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-02-04 19:02:03,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,096 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-02-04 19:02:03,098 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-02-04 19:02:03,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:33 [2018-02-04 19:02:03,131 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-02-04 19:02:03,133 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-02-04 19:02:03,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-02-04 19:02:03,225 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-02-04 19:02:03,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:03,230 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-02-04 19:02:03,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-02-04 19:02:03,248 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-02-04 19:02:03,249 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-02-04 19:02:03,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:16 [2018-02-04 19:02:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:02:03,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:02:03,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:02:03,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:02:03,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:02:03,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=219, Unknown=14, NotChecked=0, Total=272 [2018-02-04 19:02:03,354 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 17 states. [2018-02-04 19:02:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:03,737 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-02-04 19:02:03,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:02:03,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-04 19:02:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:03,738 INFO L225 Difference]: With dead ends: 112 [2018-02-04 19:02:03,738 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 19:02:03,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=389, Unknown=14, NotChecked=0, Total=462 [2018-02-04 19:02:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 19:02:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 19:02:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 19:02:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-02-04 19:02:03,741 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 48 [2018-02-04 19:02:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:03,742 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-02-04 19:02:03,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:02:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-02-04 19:02:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:02:03,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:03,742 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:03,742 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-02-04 19:02:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash -612693804, now seen corresponding path program 1 times [2018-02-04 19:02:03,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:03,742 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:03,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:03,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:03,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:03,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:03,755 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:03,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:03,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:03,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:03,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:03,856 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 11 treesize of output 8 [2018-02-04 19:02:03,857 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 8 treesize of output 7 [2018-02-04 19:02:03,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,865 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-02-04 19:02:03,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-02-04 19:02:03,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:03,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:03,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 29 [2018-02-04 19:02:03,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,893 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-02-04 19:02:03,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-02-04 19:02:03,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 19:02:03,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:03,958 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-02-04 19:02:03,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-02-04 19:02:09,974 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 16 [2018-02-04 19:02:10,391 WARN L143 SmtUtils]: Spent 404ms on a formula simplification that was a NOOP. DAG size: 22 [2018-02-04 19:02:12,411 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 19:02:12,420 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (exists ((v_probe_unsafe_19_~a.base_BEFORE_CALL_12 Int) (f19_~a.offset Int)) (and (<= 0 f19_~a.offset) (not (= (select (select |c_#memory_$Pointer$.base| v_probe_unsafe_19_~a.base_BEFORE_CALL_12) f19_~a.offset) v_probe_unsafe_19_~a.base_BEFORE_CALL_12)) (<= f19_~a.offset 0))))) (or (and .cse0 (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset)))) .cse1) (and .cse1 (exists ((v_prenex_22 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_22))) (and (= |c_#valid| (store |c_old(#valid)| .cse2 0)) (<= 0 v_prenex_22) (<= v_prenex_22 |c_f19_undo_#in~a.offset|) (not (= .cse2 0)))))) (and .cse0 (exists ((v_prenex_21 Int)) (and (<= v_prenex_21 |c_f19_undo_#in~a.offset|) (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_21) 0)) (<= 0 v_prenex_21))) .cse1))) is different from true [2018-02-04 19:02:12,429 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#valid| |c_old(#valid)|))) (or (and .cse0 (exists ((v_prenex_21 Int)) (and (<= v_prenex_21 |c_f19_undo_#in~a.offset|) (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_21) 0)) (<= 0 v_prenex_21))) (exists ((v_prenex_27 Int) (v_prenex_26 Int)) (and (<= v_prenex_27 0) (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_26) v_prenex_27) v_prenex_26)) (<= 0 v_prenex_27)))) (and (exists ((v_prenex_25 Int) (v_prenex_24 Int)) (and (<= 0 v_prenex_25) (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_24) v_prenex_25) v_prenex_24)) (<= v_prenex_25 0))) (exists ((v_prenex_22 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_22))) (and (= |c_#valid| (store |c_old(#valid)| .cse1 0)) (<= 0 v_prenex_22) (<= v_prenex_22 |c_f19_undo_#in~a.offset|) (not (= .cse1 0)))))) (and .cse0 (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset)))) (exists ((v_probe_unsafe_19_~a.base_BEFORE_CALL_12 Int) (f19_~a.offset Int)) (and (<= 0 f19_~a.offset) (not (= (select (select |c_#memory_$Pointer$.base| v_probe_unsafe_19_~a.base_BEFORE_CALL_12) f19_~a.offset) v_probe_unsafe_19_~a.base_BEFORE_CALL_12)) (<= f19_~a.offset 0)))))) is different from true [2018-02-04 19:02:12,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:12,442 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:12,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:12,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 90 [2018-02-04 19:02:12,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:12,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-02-04 19:02:12,500 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-02-04 19:02:12,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:12,530 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:12,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-02-04 19:02:12,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:12,553 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:12,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 19:02:12,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:12,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2018-02-04 19:02:12,573 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:12,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-02-04 19:02:12,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:12,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-02-04 19:02:12,597 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:12,615 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:12,615 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:12,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-02-04 19:02:12,616 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:12,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:02:12,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 19:02:12,661 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:182, output treesize:46 [2018-02-04 19:02:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:02:12,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:02:12,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 19:02:12,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:02:12,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:02:12,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=5, NotChecked=66, Total=380 [2018-02-04 19:02:12,692 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 20 states. [2018-02-04 19:02:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:46,092 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-02-04 19:02:46,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:02:46,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-02-04 19:02:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:46,093 INFO L225 Difference]: With dead ends: 98 [2018-02-04 19:02:46,093 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 19:02:46,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=99, Invalid=606, Unknown=5, NotChecked=102, Total=812 [2018-02-04 19:02:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 19:02:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-02-04 19:02:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 19:02:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 19:02:46,096 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 51 [2018-02-04 19:02:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:46,096 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 19:02:46,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:02:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 19:02:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:02:46,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:46,097 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:46,097 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-02-04 19:02:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -749095891, now seen corresponding path program 1 times [2018-02-04 19:02:46,097 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:46,097 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:46,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:46,098 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:46,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:46,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:46,111 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:46,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:46,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:46,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:46,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:46,157 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-02-04 19:02:46,158 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-02-04 19:02:46,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:46,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:46,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:46,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 19:02:46,238 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (and (= (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|) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2018-02-04 19:02:46,244 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-02-04 19:02:46,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:46,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-02-04 19:02:46,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:46,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:46,253 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-02-04 19:02:46,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-02-04 19:02:52,440 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 22 treesize of output 16 [2018-02-04 19:02:52,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:52,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-02-04 19:02:52,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:52,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:52,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:52,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2018-02-04 19:02:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:02:52,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:02:52,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:02:52,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:02:52,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:02:52,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=4, NotChecked=32, Total=342 [2018-02-04 19:02:52,459 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 19 states. [2018-02-04 19:02:56,753 WARN L143 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 28 [2018-02-04 19:02:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:56,925 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-04 19:02:56,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:02:56,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-04 19:02:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:56,925 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:02:56,925 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:02:56,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=112, Invalid=757, Unknown=5, NotChecked=56, Total=930 [2018-02-04 19:02:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:02:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 19:02:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 19:02:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 19:02:56,927 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 51 [2018-02-04 19:02:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:56,927 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 19:02:56,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:02:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 19:02:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:02:56,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:56,928 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:56,928 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-02-04 19:02:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash -749095890, now seen corresponding path program 1 times [2018-02-04 19:02:56,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:56,928 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:56,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:56,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:56,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:56,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:56,942 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:56,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:56,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:56,943 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:56,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:56,988 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-02-04 19:02:56,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:56,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:56,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:02:57,009 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-02-04 19:02:57,010 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-02-04 19:02:57,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 19:02:57,045 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:02:57,068 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) (exists ((|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (<= f19_~a.offset |c_f19_#in~a.offset|) (= |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|)))))) is different from true [2018-02-04 19:02:57,077 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-02-04 19:02:57,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,086 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-02-04 19:02:57,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:57,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 25 [2018-02-04 19:02:57,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:57,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2018-02-04 19:02:57,200 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 17 treesize of output 13 [2018-02-04 19:02:57,202 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 13 treesize of output 5 [2018-02-04 19:02:57,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-04 19:02:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:02:57,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:02:57,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:02:57,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:02:57,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:02:57,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=296, Unknown=3, NotChecked=70, Total=420 [2018-02-04 19:02:57,243 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 21 states. [2018-02-04 19:02:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:57,624 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 19:02:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:02:57,625 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-04 19:02:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:57,625 INFO L225 Difference]: With dead ends: 95 [2018-02-04 19:02:57,625 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 19:02:57,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=915, Unknown=5, NotChecked=126, Total=1190 [2018-02-04 19:02:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 19:02:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-02-04 19:02:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 19:02:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 19:02:57,627 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 51 [2018-02-04 19:02:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:57,627 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 19:02:57,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:02:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 19:02:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:02:57,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:57,627 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:57,628 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-02-04 19:02:57,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1813638727, now seen corresponding path program 1 times [2018-02-04 19:02:57,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:57,628 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:57,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:57,628 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:57,629 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:57,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:57,634 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:57,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:57,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:57,635 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:57,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:57,666 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-02-04 19:02:57,667 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-02-04 19:02:57,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 19:02:57,687 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret2.offset| Int) (f19_~a.offset Int)) (and (= |c_#memory_$Pointer$.offset| (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 |f19_#t~ret2.offset|))) (<= f19_~a.offset |c_f19_#in~a.offset|))) is different from true [2018-02-04 19:02:57,691 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-02-04 19:02:57,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:57,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 23 [2018-02-04 19:02:57,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-02-04 19:02:57,726 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-02-04 19:02:57,727 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-02-04 19:02:57,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:57,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 19:02:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:02:57,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:02:57,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 19:02:57,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:02:57,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:02:57,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-02-04 19:02:57,739 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 11 states. [2018-02-04 19:02:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:58,009 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-04 19:02:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:02:58,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-02-04 19:02:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:58,009 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:02:58,009 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:02:58,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=273, Unknown=1, NotChecked=34, Total=380 [2018-02-04 19:02:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:02:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 19:02:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 19:02:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 19:02:58,012 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 52 [2018-02-04 19:02:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:58,012 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 19:02:58,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:02:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 19:02:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:02:58,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:58,013 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:58,013 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-02-04 19:02:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1813638726, now seen corresponding path program 1 times [2018-02-04 19:02:58,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:58,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:58,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:58,014 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:58,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:58,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:58,025 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:58,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:58,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:58,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:58,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:58,079 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-02-04 19:02:58,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:02:58,103 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-02-04 19:02:58,104 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-02-04 19:02:58,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 19:02:58,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 39 [2018-02-04 19:02:58,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,262 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-02-04 19:02:58,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,265 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-02-04 19:02:58,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,282 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-02-04 19:02:58,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:44 [2018-02-04 19:02:58,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-02-04 19:02:58,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,387 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-02-04 19:02:58,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2018-02-04 19:02:58,519 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_42 Int)) (and (<= 0 v_prenex_42) (<= v_prenex_42 v_prenex_41) (not (let ((.cse0 (select |c_#memory_$Pointer$.base| v_prenex_40))) (= (select .cse0 v_prenex_42) (select .cse0 (+ v_prenex_41 4))))) (<= v_prenex_41 0))) (exists ((v_prenex_38 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_38))) (and (<= v_prenex_38 |c_f19_undo_#in~a.offset|) (<= 0 v_prenex_38) (= (store |c_old(#valid)| .cse1 0) |c_#valid|) (not (= .cse1 0)))))) (and (= |c_#valid| |c_old(#valid)|) (exists ((v_probe_unsafe_19_~a.base_BEFORE_CALL_22 Int) (v_probe_unsafe_19_~a.offset_BEFORE_CALL_22 Int) (f19_~a.offset Int)) (and (<= 0 f19_~a.offset) (<= v_probe_unsafe_19_~a.offset_BEFORE_CALL_22 0) (not (let ((.cse2 (select |c_#memory_$Pointer$.base| v_probe_unsafe_19_~a.base_BEFORE_CALL_22))) (= (select .cse2 f19_~a.offset) (select .cse2 (+ v_probe_unsafe_19_~a.offset_BEFORE_CALL_22 4))))) (<= f19_~a.offset v_probe_unsafe_19_~a.offset_BEFORE_CALL_22))) (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset)))))) is different from true [2018-02-04 19:02:58,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,545 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:58,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,546 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 91 treesize of output 118 [2018-02-04 19:02:58,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-04 19:02:58,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:172, output treesize:148 [2018-02-04 19:02:58,713 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 66 treesize of output 54 [2018-02-04 19:02:58,715 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:58,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-02-04 19:02:58,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:58,755 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 53 treesize of output 45 [2018-02-04 19:02:58,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,758 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:02:58,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:58,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-04 19:02:58,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:58,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:58,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:02:58,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:120, output treesize:31 [2018-02-04 19:02:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:02:58,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:02:58,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 19:02:58,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:02:58,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:02:58,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=481, Unknown=11, NotChecked=44, Total=600 [2018-02-04 19:02:58,841 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 25 states. [2018-02-04 19:02:59,338 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse3 (exists ((v_probe_unsafe_19_~a.base_BEFORE_CALL_22 Int) (v_probe_unsafe_19_~a.offset_BEFORE_CALL_22 Int) (f19_~a.offset Int)) (and (<= 0 f19_~a.offset) (<= v_probe_unsafe_19_~a.offset_BEFORE_CALL_22 0) (not (let ((.cse5 (select |c_#memory_$Pointer$.base| v_probe_unsafe_19_~a.base_BEFORE_CALL_22))) (= (select .cse5 f19_~a.offset) (select .cse5 (+ v_probe_unsafe_19_~a.offset_BEFORE_CALL_22 4))))) (<= f19_~a.offset v_probe_unsafe_19_~a.offset_BEFORE_CALL_22))))) (let ((.cse2 (and (= |c_#valid| |c_old(#valid)|) .cse3 (exists ((f19_undo_~a.offset Int)) (and (<= 0 f19_undo_~a.offset) (<= f19_undo_~a.offset |c_f19_undo_#in~a.offset|) (= 0 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) f19_undo_~a.offset)))))) (.cse1 (exists ((v_prenex_38 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) v_prenex_38))) (and (<= v_prenex_38 |c_f19_undo_#in~a.offset|) (<= 0 v_prenex_38) (= (store |c_old(#valid)| .cse4 0) |c_#valid|) (not (= .cse4 0))))))) (and (or (and (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_42 Int)) (and (<= 0 v_prenex_42) (<= v_prenex_42 v_prenex_41) (not (let ((.cse0 (select |c_#memory_$Pointer$.base| v_prenex_40))) (= (select .cse0 v_prenex_42) (select .cse0 (+ v_prenex_41 4))))) (<= v_prenex_41 0))) .cse1) .cse2) (or .cse2 (and .cse3 .cse1))))) is different from true [2018-02-04 19:02:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:59,536 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-04 19:02:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:02:59,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-02-04 19:02:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:59,536 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:02:59,536 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:02:59,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=1105, Unknown=19, NotChecked=138, Total=1406 [2018-02-04 19:02:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:02:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-04 19:02:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:02:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 19:02:59,539 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 52 [2018-02-04 19:02:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:59,539 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 19:02:59,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:02:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 19:02:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:02:59,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:59,539 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:59,539 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-02-04 19:02:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1679349496, now seen corresponding path program 1 times [2018-02-04 19:02:59,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:59,540 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:59,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:59,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:59,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:59,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:02:59,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:02:59,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:02:59,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:02:59,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:02:59,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:02:59,565 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-02-04 19:02:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:02:59,572 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-02-04 19:02:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:02:59,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 19:02:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:02:59,573 INFO L225 Difference]: With dead ends: 96 [2018-02-04 19:02:59,573 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 19:02:59,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:02:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 19:02:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-04 19:02:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:02:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-04 19:02:59,575 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 52 [2018-02-04 19:02:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:02:59,576 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-04 19:02:59,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:02:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-04 19:02:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:02:59,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:02:59,576 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:02:59,576 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-02-04 19:02:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270255, now seen corresponding path program 1 times [2018-02-04 19:02:59,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:02:59,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:02:59,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:59,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:59,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:02:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:59,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:02:59,601 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:02:59,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:02:59,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:02:59,602 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:02:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:02:59,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:02:59,644 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-02-04 19:02:59,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:02:59,687 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-02-04 19:02:59,688 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-02-04 19:02:59,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 19:02:59,751 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-02-04 19:02:59,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:59,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 25 [2018-02-04 19:02:59,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:17 [2018-02-04 19:02:59,775 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 11 treesize of output 1 [2018-02-04 19:02:59,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:02:59,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 19:02:59,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:59,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:59,803 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 17 treesize of output 10 [2018-02-04 19:02:59,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-02-04 19:02:59,850 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 16 treesize of output 12 [2018-02-04 19:02:59,851 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 12 treesize of output 4 [2018-02-04 19:02:59,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-02-04 19:02:59,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:02:59,888 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 20 treesize of output 25 [2018-02-04 19:02:59,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:02:59,897 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-02-04 19:02:59,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 19:02:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:02:59,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:02:59,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 19:02:59,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:02:59,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:02:59,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:02:59,964 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 23 states. [2018-02-04 19:03:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:00,616 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-02-04 19:03:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:03:00,617 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-04 19:03:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:00,617 INFO L225 Difference]: With dead ends: 100 [2018-02-04 19:03:00,617 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 19:03:00,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 19:03:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 19:03:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-02-04 19:03:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 19:03:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-04 19:03:00,620 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 55 [2018-02-04 19:03:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:00,620 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-04 19:03:00,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:03:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-04 19:03:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:03:00,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:00,621 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:03:00,621 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-02-04 19:03:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270256, now seen corresponding path program 1 times [2018-02-04 19:03:00,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:00,621 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:00,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:00,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:00,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:00,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:03:00,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:00,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:03:00,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:03:00,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:03:00,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:03:00,682 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 8 states. [2018-02-04 19:03:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:00,739 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 19:03:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:03:00,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 19:03:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:00,740 INFO L225 Difference]: With dead ends: 95 [2018-02-04 19:03:00,740 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 19:03:00,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:03:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 19:03:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 19:03:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:03:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-04 19:03:00,742 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 55 [2018-02-04 19:03:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:00,743 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-04 19:03:00,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:03:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-04 19:03:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:03:00,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:00,743 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 19:03:00,743 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-02-04 19:03:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash -801196919, now seen corresponding path program 1 times [2018-02-04 19:03:00,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:00,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:00,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:00,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:00,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:00,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:03:00,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:03:00,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 19:03:00,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:03:00,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:03:00,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:03:00,877 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 15 states. [2018-02-04 19:03:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:01,059 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 19:03:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:03:01,059 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 19:03:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:01,060 INFO L225 Difference]: With dead ends: 94 [2018-02-04 19:03:01,060 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 19:03:01,060 INFO L554 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-02-04 19:03:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 19:03:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 19:03:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 19:03:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 19:03:01,061 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 56 [2018-02-04 19:03:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:01,061 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 19:03:01,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:03:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 19:03:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:03:01,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:01,062 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 19:03:01,062 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-02-04 19:03:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash -801196918, now seen corresponding path program 1 times [2018-02-04 19:03:01,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:01,062 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:01,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:01,063 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:01,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:01,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:01,077 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:03:01,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:03:01,078 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:03:01,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:01,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:03:01,123 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-02-04 19:03:01,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:03:01,149 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-02-04 19:03:01,151 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-02-04 19:03:01,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 19:03:01,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 39 [2018-02-04 19:03:01,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,249 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-02-04 19:03:01,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,251 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-02-04 19:03:01,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,260 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-02-04 19:03:01,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:41 [2018-02-04 19:03:01,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,421 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 66 treesize of output 54 [2018-02-04 19:03:01,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,447 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 2 xjuncts. [2018-02-04 19:03:01,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:175, output treesize:94 [2018-02-04 19:03:01,555 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 57 treesize of output 45 [2018-02-04 19:03:01,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,557 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:03:01,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-02-04 19:03:01,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:01,577 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 46 treesize of output 38 [2018-02-04 19:03:01,578 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:03:01,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:01,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-02-04 19:03:01,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:03:01,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:03:01,599 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 2 xjuncts. [2018-02-04 19:03:01,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:104, output treesize:31 [2018-02-04 19:03:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:01,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:03:01,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 19:03:01,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 19:03:01,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 19:03:01,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=581, Unknown=6, NotChecked=0, Total=650 [2018-02-04 19:03:01,634 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 26 states. [2018-02-04 19:03:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:02,615 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 19:03:02,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:03:02,615 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-02-04 19:03:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:02,616 INFO L225 Difference]: With dead ends: 95 [2018-02-04 19:03:02,616 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 19:03:02,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=1321, Unknown=11, NotChecked=0, Total=1482 [2018-02-04 19:03:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 19:03:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 19:03:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 19:03:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-04 19:03:02,619 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 56 [2018-02-04 19:03:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:02,619 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-04 19:03:02,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 19:03:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-04 19:03:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:03:02,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:02,620 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 19:03:02,620 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-02-04 19:03:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash -101964777, now seen corresponding path program 1 times [2018-02-04 19:03:02,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:02,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:02,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:02,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:02,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:02,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:03:02,636 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:03:02,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:03:02,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:03:02,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:03:02,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:03:02,691 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-02-04 19:03:02,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:03:02,721 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-02-04 19:03:02,723 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-02-04 19:03:02,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,732 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-02-04 19:03:02,734 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-02-04 19:03:02,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-02-04 19:03:02,752 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-02-04 19:03:02,754 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-02-04 19:03:02,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2018-02-04 19:03:02,815 WARN L1033 $PredicateComparison]: unable to prove that (exists ((f19_~a.base Int) (|f19_#t~ret2.base| Int) (f19_~a.offset Int)) (and (<= f19_~a.offset |c_f19_#in~a.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| f19_~a.base (store (select |c_old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset |f19_#t~ret2.base|))))) is different from true [2018-02-04 19:03:02,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-02-04 19:03:02,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:02,842 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 29 treesize of output 38 [2018-02-04 19:03:02,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,879 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 30 treesize of output 29 [2018-02-04 19:03:02,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,905 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2018-02-04 19:03:02,908 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-02-04 19:03:02,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,909 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-02-04 19:03:02,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:10 [2018-02-04 19:03:02,989 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-02-04 19:03:02,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:02,990 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-02-04 19:03:02,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:10 [2018-02-04 19:03:03,045 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 31 treesize of output 25 [2018-02-04 19:03:03,047 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 25 treesize of output 10 [2018-02-04 19:03:03,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:03,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:03,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:03:03,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-02-04 19:03:03,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:03,072 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-02-04 19:03:03,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:03:03,080 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-02-04 19:03:03,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-02-04 19:03:03,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:03,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:03:03,111 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-02-04 19:03:03,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:03:03,118 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-02-04 19:03:03,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:15 [2018-02-04 19:03:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:03:03,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:03:03,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 19:03:03,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:03:03,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:03:03,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=304, Unknown=1, NotChecked=34, Total=380 [2018-02-04 19:03:03,180 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 20 states. [2018-02-04 19:03:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:03:13,769 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 19:03:13,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 19:03:13,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-04 19:03:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:03:13,769 INFO L225 Difference]: With dead ends: 95 [2018-02-04 19:03:13,770 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 19:03:13,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1324, Unknown=1, NotChecked=74, Total=1560 [2018-02-04 19:03:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 19:03:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-02-04 19:03:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 19:03:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 19:03:13,772 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 61 [2018-02-04 19:03:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:03:13,772 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 19:03:13,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:03:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 19:03:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 19:03:13,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:03:13,773 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 19:03:13,773 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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-02-04 19:03:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1134059184, now seen corresponding path program 1 times [2018-02-04 19:03:13,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:03:13,773 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:03:13,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:13,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:03:13,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:03:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:03:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:03:13,810 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:03:13,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:03:13 BoogieIcfgContainer [2018-02-04 19:03:13,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:03:13,838 INFO L168 Benchmark]: Toolchain (without parser) took 190826.59 ms. Allocated memory was 402.7 MB in the beginning and 711.5 MB in the end (delta: 308.8 MB). Free memory was 359.5 MB in the beginning and 624.9 MB in the end (delta: -265.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:13,840 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:03:13,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.19 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:13,840 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 345.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:13,840 INFO L168 Benchmark]: RCFGBuilder took 228.26 ms. Allocated memory is still 402.7 MB. Free memory was 345.0 MB in the beginning and 319.0 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:13,840 INFO L168 Benchmark]: TraceAbstraction took 190409.00 ms. Allocated memory was 402.7 MB in the beginning and 711.5 MB in the end (delta: 308.8 MB). Free memory was 319.0 MB in the beginning and 624.9 MB in the end (delta: -305.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:03:13,842 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.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.19 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.32 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 345.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 228.26 ms. Allocated memory is still 402.7 MB. Free memory was 345.0 MB in the beginning and 319.0 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 190409.00 ms. Allocated memory was 402.7 MB in the beginning and 711.5 MB in the end (delta: 308.8 MB). Free memory was 319.0 MB in the beginning and 624.9 MB in the end (delta: -305.9 MB). Peak memory consumption was 2.9 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() [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] [L1457] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}, ret=3] [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}, ret=3] [L1458] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={10:0}, ret=3] [L1458] COND FALSE !(!a->q) [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() [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] [L1440] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}] [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}] [L1441] FCALL a->p VAL [a={13:0}, a={13:0}, a->p={11:0}] [L1441] COND TRUE a->p [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) [L1461] COND FALSE !(\read(ret)) VAL [a={13:0}, a={13:0}, ret=0] [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() VAL [a={13:0}, a={13:0}, g19()=0, ret=0] [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) VAL [a={13:0}] [L1447] EXPR, FCALL a->p VAL [a={13:0}, a={13:0}, a->p={11:0}] [L1447] RET, FCALL free(a->p) VAL [a={13:0}, a={13:0}, a->p={11: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={10:0}, ret=0] [L1472] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={10: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); [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={10:0}] [L1478] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. UNSAFE Result, 190.3s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 167.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2814 SDtfs, 2250 SDslu, 12975 SDs, 0 SdLazy, 10641 SolverSat, 703 SolverUnsat, 207 SolverUnknown, 0 SolverNotchecked, 83.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1158 GetRequests, 571 SyntacticMatches, 20 SemanticMatches, 567 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 101.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 277 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 2465 NumberOfCodeBlocks, 2465 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1593 ConstructedInterpolants, 218 QuantifiedInterpolants, 585518 SizeOfPredicates, 194 NumberOfNonLiveVariables, 3559 ConjunctsInSsa, 629 ConjunctsInUnsatCore, 41 InterpolantComputations, 31 PerfectInterpolantSequences, 142/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-03-13-847.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-03-13-847.csv Received shutdown request...