java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:03:44,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:03:44,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:03:44,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:03:44,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:03:44,441 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:03:44,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:03:44,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:03:44,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:03:44,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:03:44,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:03:44,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:03:44,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:03:44,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:03:44,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:03:44,459 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:03:44,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:03:44,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:03:44,464 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:03:44,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:03:44,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:03:44,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:03:44,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:03:44,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:03:44,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:03:44,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:03:44,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:03:44,473 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:03:44,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:03:44,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:03:44,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:03:44,474 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:03:44,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:03:44,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:03:44,490 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:03:44,491 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:03:44,491 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:03:44,491 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:03:44,491 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:03:44,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:03:44,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:03:44,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:03:44,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:03:44,500 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:03:44,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:03:44,500 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:03:44,500 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:03:44,500 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:03:44,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:03:44,501 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:03:44,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:03:44,501 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:03:44,501 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:03:44,501 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:03:44,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:03:44,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:03:44,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:03:44,502 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:03:44,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:03:44,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:03:44,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:03:44,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:03:44,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:03:44,503 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:03:44,504 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:03:44,504 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:03:44,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:03:44,573 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:03:44,580 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:03:44,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:03:44,582 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:03:44,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-31 09:03:44,798 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:03:44,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:03:44,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:03:44,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:03:44,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:03:44,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:03:44" (1/1) ... [2018-01-31 09:03:44,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2403e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:44, skipping insertion in model container [2018-01-31 09:03:44,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:03:44" (1/1) ... [2018-01-31 09:03:44,843 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:03:44,927 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:03:45,110 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:03:45,136 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:03:45,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45 WrapperNode [2018-01-31 09:03:45,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:03:45,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:03:45,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:03:45,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:03:45,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... [2018-01-31 09:03:45,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:03:45,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:03:45,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:03:45,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:03:45,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-31 09:03:45,265 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 09:03:45,266 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:03:45,266 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:03:45,266 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:03:45,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:03:45,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:03:45,266 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:03:45,266 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-31 09:03:45,267 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-31 09:03:45,268 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 09:03:45,268 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:03:45,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:03:45,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:03:45,752 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:03:45,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:03:45 BoogieIcfgContainer [2018-01-31 09:03:45,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:03:45,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:03:45,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:03:45,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:03:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:03:44" (1/3) ... [2018-01-31 09:03:45,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c345838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:03:45, skipping insertion in model container [2018-01-31 09:03:45,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:45" (2/3) ... [2018-01-31 09:03:45,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c345838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:03:45, skipping insertion in model container [2018-01-31 09:03:45,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:03:45" (3/3) ... [2018-01-31 09:03:45,761 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-31 09:03:45,770 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:03:45,780 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 09:03:45,836 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:03:45,836 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:03:45,836 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:03:45,837 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:03:45,837 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:03:45,837 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:03:45,837 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:03:45,837 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:03:45,838 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:03:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-31 09:03:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:03:45,869 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:45,871 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, 1, 1] [2018-01-31 09:03:45,871 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1538501150, now seen corresponding path program 1 times [2018-01-31 09:03:45,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:45,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:45,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:45,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:45,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:46,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:46,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:46,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:46,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:46,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:46,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:46,424 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 6 states. [2018-01-31 09:03:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:46,751 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-01-31 09:03:46,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:46,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 09:03:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:46,765 INFO L225 Difference]: With dead ends: 110 [2018-01-31 09:03:46,765 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:03:46,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:03:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-01-31 09:03:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:03:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-31 09:03:46,805 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 32 [2018-01-31 09:03:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:46,805 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-31 09:03:46,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-31 09:03:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:03:46,807 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:46,807 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, 1, 1, 1] [2018-01-31 09:03:46,812 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1860226763, now seen corresponding path program 1 times [2018-01-31 09:03:46,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:46,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:46,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:46,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:46,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:46,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:46,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:46,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:03:46,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:46,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:46,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:46,936 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 5 states. [2018-01-31 09:03:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:47,061 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-01-31 09:03:47,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:47,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-31 09:03:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:47,065 INFO L225 Difference]: With dead ends: 107 [2018-01-31 09:03:47,065 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:03:47,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:03:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2018-01-31 09:03:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 09:03:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-01-31 09:03:47,084 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 33 [2018-01-31 09:03:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:47,086 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-01-31 09:03:47,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-01-31 09:03:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 09:03:47,089 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:47,089 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, 1, 1, 1] [2018-01-31 09:03:47,089 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1860226764, now seen corresponding path program 1 times [2018-01-31 09:03:47,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:47,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:47,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:47,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:47,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:47,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:47,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:47,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:03:47,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:47,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:47,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:47,178 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 5 states. [2018-01-31 09:03:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:47,255 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-01-31 09:03:47,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:47,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-31 09:03:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:47,258 INFO L225 Difference]: With dead ends: 107 [2018-01-31 09:03:47,258 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:03:47,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:03:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2018-01-31 09:03:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 09:03:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-31 09:03:47,277 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 33 [2018-01-31 09:03:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:47,277 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-31 09:03:47,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-31 09:03:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:47,286 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:47,286 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, 1, 1, 1, 1] [2018-01-31 09:03:47,287 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash 264423317, now seen corresponding path program 1 times [2018-01-31 09:03:47,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:47,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:47,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:47,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:47,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:47,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:47,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:47,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:47,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:47,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:47,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:47,449 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 6 states. [2018-01-31 09:03:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:47,523 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-01-31 09:03:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:03:47,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 09:03:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:47,526 INFO L225 Difference]: With dead ends: 99 [2018-01-31 09:03:47,526 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 09:03:47,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 09:03:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 09:03:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 09:03:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-31 09:03:47,538 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 34 [2018-01-31 09:03:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:47,538 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-31 09:03:47,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-31 09:03:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:47,540 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:47,540 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, 1, 1, 1, 1] [2018-01-31 09:03:47,541 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 264423318, now seen corresponding path program 1 times [2018-01-31 09:03:47,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:47,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:47,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:47,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:47,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:47,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:47,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:47,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:47,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:47,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:47,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:47,649 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2018-01-31 09:03:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:48,468 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-01-31 09:03:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:48,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 09:03:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:48,470 INFO L225 Difference]: With dead ends: 107 [2018-01-31 09:03:48,470 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:03:48,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:03:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2018-01-31 09:03:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 09:03:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-31 09:03:48,481 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 34 [2018-01-31 09:03:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:48,481 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-31 09:03:48,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-31 09:03:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:48,483 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:48,483 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, 1, 1, 1, 1] [2018-01-31 09:03:48,483 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:48,483 INFO L82 PathProgramCache]: Analyzing trace with hash -988619436, now seen corresponding path program 1 times [2018-01-31 09:03:48,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:48,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:48,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:48,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:48,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:48,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:48,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:48,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:03:48,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:03:48,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:03:48,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:03:48,665 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 4 states. [2018-01-31 09:03:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:48,846 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-01-31 09:03:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:03:48,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-31 09:03:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:48,850 INFO L225 Difference]: With dead ends: 121 [2018-01-31 09:03:48,850 INFO L226 Difference]: Without dead ends: 108 [2018-01-31 09:03:48,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-31 09:03:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-01-31 09:03:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 09:03:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-01-31 09:03:48,878 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 34 [2018-01-31 09:03:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:48,879 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-01-31 09:03:48,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:03:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-01-31 09:03:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:03:48,885 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:48,885 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, 1, 1, 1, 1, 1] [2018-01-31 09:03:48,885 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1081081290, now seen corresponding path program 1 times [2018-01-31 09:03:48,897 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:48,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:48,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:48,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:48,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:48,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:49,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:49,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:49,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:49,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:49,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:49,005 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 6 states. [2018-01-31 09:03:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:49,103 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-01-31 09:03:49,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:49,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:03:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:49,105 INFO L225 Difference]: With dead ends: 116 [2018-01-31 09:03:49,105 INFO L226 Difference]: Without dead ends: 103 [2018-01-31 09:03:49,105 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-01-31 09:03:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-31 09:03:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-01-31 09:03:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 09:03:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-01-31 09:03:49,117 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 35 [2018-01-31 09:03:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:49,117 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-01-31 09:03:49,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-01-31 09:03:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:03:49,119 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:49,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:49,119 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:49,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1222478795, now seen corresponding path program 1 times [2018-01-31 09:03:49,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:49,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:49,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:49,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:49,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:49,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:49,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:49,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:49,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:49,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:49,215 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 5 states. [2018-01-31 09:03:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:49,261 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-01-31 09:03:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:49,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-31 09:03:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:49,263 INFO L225 Difference]: With dead ends: 134 [2018-01-31 09:03:49,263 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 09:03:49,264 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-01-31 09:03:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 09:03:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 09:03:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 09:03:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-01-31 09:03:49,271 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 43 [2018-01-31 09:03:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:49,271 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-01-31 09:03:49,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-01-31 09:03:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:03:49,273 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:49,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:49,273 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 236883989, now seen corresponding path program 1 times [2018-01-31 09:03:49,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:49,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:49,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:49,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:49,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:49,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:49,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:49,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:49,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:49,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:49,388 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 6 states. [2018-01-31 09:03:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:49,450 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-01-31 09:03:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:49,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-31 09:03:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:49,452 INFO L225 Difference]: With dead ends: 99 [2018-01-31 09:03:49,452 INFO L226 Difference]: Without dead ends: 82 [2018-01-31 09:03:49,452 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-01-31 09:03:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-31 09:03:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-01-31 09:03:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:03:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-31 09:03:49,460 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 44 [2018-01-31 09:03:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:49,460 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-31 09:03:49,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-31 09:03:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:03:49,461 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:49,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:49,462 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash -422079254, now seen corresponding path program 1 times [2018-01-31 09:03:49,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:49,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:49,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:49,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:49,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:49,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:49,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:49,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:49,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:49,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:49,679 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 8 states. [2018-01-31 09:03:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:49,917 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-01-31 09:03:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:03:49,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-01-31 09:03:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:49,918 INFO L225 Difference]: With dead ends: 79 [2018-01-31 09:03:49,918 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:03:49,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:03:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:03:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-01-31 09:03:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:03:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-01-31 09:03:49,926 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 44 [2018-01-31 09:03:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:49,927 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-01-31 09:03:49,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-01-31 09:03:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 09:03:49,928 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:49,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:49,928 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash -422079253, now seen corresponding path program 1 times [2018-01-31 09:03:49,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:49,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:49,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:49,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:49,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:50,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:50,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:03:50,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:03:50,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:03:50,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:03:50,463 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 9 states. [2018-01-31 09:03:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:50,931 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-31 09:03:50,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:03:50,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-01-31 09:03:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:50,932 INFO L225 Difference]: With dead ends: 77 [2018-01-31 09:03:50,932 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:03:50,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:03:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:03:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:03:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:03:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-31 09:03:50,939 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 44 [2018-01-31 09:03:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:50,940 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-31 09:03:50,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:03:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-31 09:03:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:03:50,941 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:50,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:50,941 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash 54482631, now seen corresponding path program 1 times [2018-01-31 09:03:50,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:50,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:50,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:50,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:50,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:50,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:51,403 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 19 DAG size of output 14 [2018-01-31 09:03:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:51,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:51,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:03:51,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:03:51,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:03:51,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:03:51,811 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 9 states. [2018-01-31 09:03:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:52,261 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-01-31 09:03:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:03:52,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-31 09:03:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:52,263 INFO L225 Difference]: With dead ends: 82 [2018-01-31 09:03:52,263 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 09:03:52,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:03:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 09:03:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 09:03:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 09:03:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-01-31 09:03:52,271 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 46 [2018-01-31 09:03:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:52,272 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-01-31 09:03:52,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:03:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-01-31 09:03:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 09:03:52,273 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:52,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:52,273 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -568282450, now seen corresponding path program 1 times [2018-01-31 09:03:52,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:52,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:52,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:52,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:52,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:52,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:52,543 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-01-31 09:03:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:52,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:52,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:52,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:52,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:52,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:52,779 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 8 states. [2018-01-31 09:03:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:52,922 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-01-31 09:03:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:03:52,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-01-31 09:03:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:52,924 INFO L225 Difference]: With dead ends: 68 [2018-01-31 09:03:52,924 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 09:03:52,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:03:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 09:03:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-31 09:03:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 09:03:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-01-31 09:03:52,932 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 54 [2018-01-31 09:03:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:52,932 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-01-31 09:03:52,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-01-31 09:03:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 09:03:52,933 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:52,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:52,934 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash -568282451, now seen corresponding path program 1 times [2018-01-31 09:03:52,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:52,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:52,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:52,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:52,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:52,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:53,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:53,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:53,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:03:53,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:03:53,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:03:53,059 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 7 states. [2018-01-31 09:03:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:53,464 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-01-31 09:03:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:03:53,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-01-31 09:03:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:53,466 INFO L225 Difference]: With dead ends: 68 [2018-01-31 09:03:53,466 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 09:03:53,467 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:03:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 09:03:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-01-31 09:03:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 09:03:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-01-31 09:03:53,476 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-01-31 09:03:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:53,476 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-01-31 09:03:53,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:03:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-01-31 09:03:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 09:03:53,477 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:53,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:53,477 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash -436886794, now seen corresponding path program 1 times [2018-01-31 09:03:53,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:53,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:53,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:53,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:53,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:53,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:53,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:53,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:03:53,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:03:53,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:03:53,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:03:53,681 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 12 states. [2018-01-31 09:03:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:53,863 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-01-31 09:03:53,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:03:53,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-01-31 09:03:53,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:53,864 INFO L225 Difference]: With dead ends: 66 [2018-01-31 09:03:53,864 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 09:03:53,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:03:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 09:03:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-31 09:03:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 09:03:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-01-31 09:03:53,872 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-01-31 09:03:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:53,873 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-01-31 09:03:53,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:03:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-01-31 09:03:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-31 09:03:53,874 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:53,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:53,874 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash -436886793, now seen corresponding path program 1 times [2018-01-31 09:03:53,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:53,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:53,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:53,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:53,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:53,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:54,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:54,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:03:54,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:03:54,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:03:54,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:03:54,134 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 12 states. [2018-01-31 09:03:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:54,387 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-01-31 09:03:54,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:03:54,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-01-31 09:03:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:54,388 INFO L225 Difference]: With dead ends: 66 [2018-01-31 09:03:54,388 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 09:03:54,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:03:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 09:03:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-01-31 09:03:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:03:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-31 09:03:54,396 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 55 [2018-01-31 09:03:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:54,396 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-31 09:03:54,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:03:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-31 09:03:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:03:54,397 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:54,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:54,398 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash -616351968, now seen corresponding path program 1 times [2018-01-31 09:03:54,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:54,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:54,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:54,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:54,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:54,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:54,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:54,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:54,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:54,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:54,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:54,442 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 5 states. [2018-01-31 09:03:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:54,457 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2018-01-31 09:03:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:54,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-31 09:03:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:54,459 INFO L225 Difference]: With dead ends: 70 [2018-01-31 09:03:54,459 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 09:03:54,459 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-01-31 09:03:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 09:03:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-31 09:03:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:03:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2018-01-31 09:03:54,467 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 56 [2018-01-31 09:03:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:54,467 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2018-01-31 09:03:54,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2018-01-31 09:03:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 09:03:54,468 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:54,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:54,469 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1097537421, now seen corresponding path program 1 times [2018-01-31 09:03:54,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:54,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:54,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:54,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:54,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:54,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:03:55,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:55,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 09:03:55,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:03:55,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:03:55,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:03:55,085 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand 15 states. [2018-01-31 09:03:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:55,580 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-01-31 09:03:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 09:03:55,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-31 09:03:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:55,581 INFO L225 Difference]: With dead ends: 64 [2018-01-31 09:03:55,581 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 09:03:55,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:03:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 09:03:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 09:03:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 09:03:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 09:03:55,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-01-31 09:03:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:55,583 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 09:03:55,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:03:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 09:03:55,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 09:03:55,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 09:03:56,006 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 30 DAG size of output 21 [2018-01-31 09:03:56,157 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 67 DAG size of output 53 [2018-01-31 09:03:56,419 INFO L402 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point L1435(line 1435) no Hoare annotation was computed. [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point L1435'(line 1435) no Hoare annotation was computed. [2018-01-31 09:03:56,419 INFO L395 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-31 09:03:56,419 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,420 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:03:56,420 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 1476) the Hoare annotation is: true [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 1474 1476) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1474 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1474 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1474 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err0RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,421 INFO L395 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) 1)) (not (= (select |old(#valid)| |disconnect_6_#in~a.base|) 1)) (not (= 0 |disconnect_6_#in~a.offset|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))) (< (select |#length| |disconnect_6_#in~a.base|) 4)) [2018-01-31 09:03:56,421 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err1RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err3RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point disconnect_6Err2RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1466 1472) no Hoare annotation was computed. [2018-01-31 09:03:56,422 INFO L399 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L395 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |entry_point_~#a7~11.base|) |entry_point_~#a7~11.offset|))) (let ((.cse0 (select |#valid| .cse1)) (.cse2 (select |#valid| |entry_point_~#a7~11.base|))) (and (<= 4 (select |#length| |entry_point_~#a7~11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a7~11.base|) |entry_point_~#a7~11.offset|)) (= 1 .cse0) (= 0 |entry_point_~#a7~11.offset|) (= (select |old(#valid)| |entry_point_~#a7~11.base|) 0) (= |#valid| (store (store |old(#valid)| .cse1 .cse0) |entry_point_~#a7~11.base| .cse2)) (not (= 0 .cse1)) (not (= |entry_point_~#a7~11.base| .cse1)) (= 1 .cse2) (= (select |old(#valid)| .cse1) 0) (= entry_point_~ret~11 0)))) [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point L1469'(lines 1469 1471) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L395 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1466 1472) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1466 1472) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L395 ceAbstractionStarter]: At program point L1467(line 1467) the Hoare annotation is: (let ((.cse0 (@diff |old(#length)| |#length|))) (and (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 0 |entry_point_~#a7~11.offset|) (= 4 (select |#length| |entry_point_~#a7~11.base|)) (= (select |old(#valid)| |entry_point_~#a7~11.base|) 0) (= 1 (select |#valid| |entry_point_~#a7~11.base|)) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point L1468''(line 1468) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-31 09:03:56,423 INFO L399 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1439'(line 1439) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L402 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1450''(line 1450) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point probe1_6Err1RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1447'''(line 1447) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L395 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 1 (select |#valid| probe1_6_~a.base)) (not (= 0 probe1_6_~p~9.base)) (= (select |old(#valid)| probe1_6_~p~9.base) (select (store |#valid| probe1_6_~p~9.base 0) probe1_6_~p~9.base)) (and (= probe1_6_~p~9.offset 0) (= 1 (select |#valid| probe1_6_~p~9.base))) (<= (+ probe1_6_~ret~9 1) 0) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L395 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= (select |old(#valid)| probe1_6_~p~9.base) 0) (= 1 (select |#valid| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-31 09:03:56,424 INFO L399 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L395 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point probe1_6Err2RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1450'''(line 1450) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1444''(line 1444) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point probe1_6Err3RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1443(line 1443) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L395 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: (or (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~a.offset 0) (= |old(#length)| |#length|)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L395 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= (select |old(#valid)| probe1_6_~p~9.base) 0) (= 1 (select |#valid| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~p~9.offset 0) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-31 09:03:56,425 INFO L399 ceAbstractionStarter]: For program point probe1_6Err0RequiresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-31 09:03:56,426 INFO L399 ceAbstractionStarter]: For program point L1446(line 1446) no Hoare annotation was computed. [2018-01-31 09:03:56,426 INFO L399 ceAbstractionStarter]: For program point L1447''(line 1447) no Hoare annotation was computed. [2018-01-31 09:03:56,426 INFO L399 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-31 09:03:56,429 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:506) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:277) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:107) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:486) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-31 09:03:56,432 INFO L168 Benchmark]: Toolchain (without parser) took 11633.02 ms. Allocated memory was 308.3 MB in the beginning and 548.9 MB in the end (delta: 240.6 MB). Free memory was 267.0 MB in the beginning and 331.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 176.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:56,434 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:03:56,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.78 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 253.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:56,434 INFO L168 Benchmark]: Boogie Preprocessor took 46.81 ms. Allocated memory is still 308.3 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:56,434 INFO L168 Benchmark]: RCFGBuilder took 557.33 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 230.0 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:56,435 INFO L168 Benchmark]: TraceAbstraction took 10677.39 ms. Allocated memory was 308.3 MB in the beginning and 548.9 MB in the end (delta: 240.6 MB). Free memory was 230.0 MB in the beginning and 331.4 MB in the end (delta: -101.4 MB). Peak memory consumption was 139.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:56,437 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.16 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 337.78 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 253.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.81 ms. Allocated memory is still 308.3 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 557.33 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 230.0 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10677.39 ms. Allocated memory was 308.3 MB in the beginning and 548.9 MB in the end (delta: 240.6 MB). Free memory was 230.0 MB in the beginning and 331.4 MB in the end (delta: -101.4 MB). Peak memory consumption was 139.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:506) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-03-56-448.csv Received shutdown request...