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_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:12:35,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:12:35,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:12:35,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:12:35,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:12:35,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:12:35,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:12:35,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:12:35,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:12:35,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:12:35,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:12:35,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:12:35,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:12:35,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:12:35,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:12:35,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:12:35,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:12:35,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:12:35,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:12:35,854 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:12:35,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:12:35,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:12:35,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:12:35,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:12:35,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:12:35,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:12:35,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:12:35,861 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:12:35,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:12:35,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:12:35,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:12:35,863 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:12:35,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:12:35,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:12:35,873 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:12:35,873 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:12:35,873 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:12:35,874 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:12:35,874 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:12:35,874 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:12:35,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:12:35,875 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:12:35,875 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:12:35,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:12:35,875 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:12:35,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:12:35,876 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:12:35,876 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:12:35,876 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:12:35,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:12:35,877 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:12:35,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:12:35,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:12:35,877 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:12:35,877 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:12:35,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:12:35,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:12:35,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:12:35,878 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:12:35,878 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:12:35,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:12:35,879 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:12:35,879 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:12:35,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:12:35,879 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:12:35,879 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:12:35,880 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:12:35,880 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:12:35,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:12:35,926 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:12:35,930 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:12:35,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:12:35,932 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:12:35,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-25 00:12:36,115 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:12:36,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:12:36,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:12:36,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:12:36,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:12:36,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29aa47da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36, skipping insertion in model container [2018-01-25 00:12:36,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,153 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:12:36,206 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:12:36,314 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:12:36,332 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:12:36,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36 WrapperNode [2018-01-25 00:12:36,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:12:36,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:12:36,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:12:36,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:12:36,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (1/1) ... [2018-01-25 00:12:36,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:12:36,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:12:36,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:12:36,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:12:36,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (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-25 00:12:36,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:12:36,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:12:36,424 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:12:36,424 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 00:12:36,424 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 00:12:36,424 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-25 00:12:36,425 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-25 00:12:36,425 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:12:36,425 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:12:36,425 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:12:36,425 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:12:36,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:12:36,426 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:12:36,426 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:12:36,426 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:12:36,426 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:12:36,426 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:12:36,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:12:36,427 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 00:12:36,427 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 00:12:36,427 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-25 00:12:36,427 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-25 00:12:36,427 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:12:36,428 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:12:36,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:12:36,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:12:36,640 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:12:36,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:12:36 BoogieIcfgContainer [2018-01-25 00:12:36,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:12:36,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:12:36,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:12:36,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:12:36,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:12:36" (1/3) ... [2018-01-25 00:12:36,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd3571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:12:36, skipping insertion in model container [2018-01-25 00:12:36,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:36" (2/3) ... [2018-01-25 00:12:36,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd3571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:12:36, skipping insertion in model container [2018-01-25 00:12:36,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:12:36" (3/3) ... [2018-01-25 00:12:36,645 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-25 00:12:36,652 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:12:36,659 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 00:12:36,704 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:12:36,704 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:12:36,704 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:12:36,704 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:12:36,704 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:12:36,705 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:12:36,705 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:12:36,705 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:12:36,705 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:12:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-25 00:12:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 00:12:36,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:36,725 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 00:12:36,725 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash 3262148, now seen corresponding path program 1 times [2018-01-25 00:12:36,731 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:36,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:36,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:36,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:36,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:36,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:36,866 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-25 00:12:36,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:36,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:12:36,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:36,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:12:36,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:12:36,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:12:36,883 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-25 00:12:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:37,100 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-25 00:12:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:12:37,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 00:12:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:37,111 INFO L225 Difference]: With dead ends: 81 [2018-01-25 00:12:37,112 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 00:12:37,114 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:12:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 00:12:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-01-25 00:12:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 00:12:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-25 00:12:37,156 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-01-25 00:12:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:37,157 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-25 00:12:37,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:12:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-25 00:12:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 00:12:37,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:37,158 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 00:12:37,158 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 3262149, now seen corresponding path program 1 times [2018-01-25 00:12:37,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:37,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:37,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:37,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:37,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:37,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:37,224 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-25 00:12:37,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:37,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:12:37,225 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:37,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:12:37,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:12:37,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:12:37,227 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-01-25 00:12:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:37,338 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-01-25 00:12:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:12:37,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 00:12:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:37,341 INFO L225 Difference]: With dead ends: 118 [2018-01-25 00:12:37,341 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 00:12:37,342 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:12:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 00:12:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-01-25 00:12:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 00:12:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-01-25 00:12:37,360 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-01-25 00:12:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:37,360 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-01-25 00:12:37,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:12:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-01-25 00:12:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:12:37,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:37,362 INFO L322 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] [2018-01-25 00:12:37,362 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:37,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751463, now seen corresponding path program 1 times [2018-01-25 00:12:37,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:37,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:37,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:37,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:37,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:37,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:37,489 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-25 00:12:37,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:37,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:12:37,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:37,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:12:37,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:12:37,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:12:37,490 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-01-25 00:12:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:37,782 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2018-01-25 00:12:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 00:12:37,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:12:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:37,784 INFO L225 Difference]: With dead ends: 124 [2018-01-25 00:12:37,784 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 00:12:37,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:12:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 00:12:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-25 00:12:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 00:12:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-01-25 00:12:37,804 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-01-25 00:12:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:37,804 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-01-25 00:12:37,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:12:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-01-25 00:12:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:12:37,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:37,805 INFO L322 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] [2018-01-25 00:12:37,805 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751462, now seen corresponding path program 1 times [2018-01-25 00:12:37,806 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:37,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:37,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:37,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:37,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:37,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:37,919 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-25 00:12:37,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:37,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:12:37,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:37,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:12:37,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:12:37,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:12:37,921 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-01-25 00:12:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:37,975 INFO L93 Difference]: Finished difference Result 145 states and 172 transitions. [2018-01-25 00:12:37,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:12:37,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:12:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:37,977 INFO L225 Difference]: With dead ends: 145 [2018-01-25 00:12:37,977 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 00:12:37,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 00:12:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-25 00:12:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 00:12:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-25 00:12:37,995 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-01-25 00:12:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:37,996 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-25 00:12:37,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:12:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-25 00:12:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:12:37,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:37,997 INFO L322 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] [2018-01-25 00:12:37,998 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261138, now seen corresponding path program 1 times [2018-01-25 00:12:37,998 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:37,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:38,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,000 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:38,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:38,067 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-25 00:12:38,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:38,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:12:38,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:38,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:12:38,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:12:38,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:12:38,068 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-01-25 00:12:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:38,086 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-25 00:12:38,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:12:38,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 00:12:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:38,088 INFO L225 Difference]: With dead ends: 125 [2018-01-25 00:12:38,088 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 00:12:38,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:12:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 00:12:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 00:12:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 00:12:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-01-25 00:12:38,095 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-01-25 00:12:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:38,095 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-01-25 00:12:38,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:12:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-01-25 00:12:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:12:38,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:38,096 INFO L322 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] [2018-01-25 00:12:38,096 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:38,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329134, now seen corresponding path program 1 times [2018-01-25 00:12:38,096 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:38,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:38,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:38,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:38,153 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-25 00:12:38,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:38,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:12:38,154 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:38,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:12:38,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:12:38,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:12:38,154 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-01-25 00:12:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:38,180 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-25 00:12:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:12:38,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:12:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:38,181 INFO L225 Difference]: With dead ends: 79 [2018-01-25 00:12:38,182 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 00:12:38,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 00:12:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 00:12:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 00:12:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-25 00:12:38,191 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-01-25 00:12:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:38,192 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-25 00:12:38,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:12:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-25 00:12:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:12:38,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:38,193 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:38,193 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813492, now seen corresponding path program 1 times [2018-01-25 00:12:38,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:38,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:38,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,195 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:38,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:38,252 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-25 00:12:38,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:38,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:12:38,253 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:38,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:12:38,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:12:38,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:12:38,254 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-01-25 00:12:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:38,287 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-25 00:12:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:12:38,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 00:12:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:38,289 INFO L225 Difference]: With dead ends: 69 [2018-01-25 00:12:38,289 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:12:38,289 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:12:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-25 00:12:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 00:12:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-25 00:12:38,298 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-01-25 00:12:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:38,299 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-25 00:12:38,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:12:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-25 00:12:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:12:38,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:38,300 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:38,300 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813493, now seen corresponding path program 1 times [2018-01-25 00:12:38,300 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:38,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:38,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:38,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:38,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-25 00:12:38,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:38,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:12:38,388 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:38,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:12:38,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:12:38,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:12:38,389 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-01-25 00:12:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:38,491 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-25 00:12:38,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:12:38,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 00:12:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:38,492 INFO L225 Difference]: With dead ends: 68 [2018-01-25 00:12:38,492 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 00:12:38,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 00:12:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 00:12:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 00:12:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-25 00:12:38,498 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-01-25 00:12:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:38,498 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-25 00:12:38,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:12:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-25 00:12:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:12:38,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:38,499 INFO L322 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-25 00:12:38,500 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:38,500 INFO L82 PathProgramCache]: Analyzing trace with hash 840727273, now seen corresponding path program 1 times [2018-01-25 00:12:38,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:38,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:38,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:38,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:38,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:38,744 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-25 00:12:38,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:38,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:12:38,745 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:38,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:12:38,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:12:38,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:12:38,746 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-01-25 00:12:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:39,053 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-25 00:12:39,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:12:39,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 00:12:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:39,054 INFO L225 Difference]: With dead ends: 76 [2018-01-25 00:12:39,055 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 00:12:39,055 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:12:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 00:12:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-01-25 00:12:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 00:12:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-25 00:12:39,062 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-01-25 00:12:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:39,063 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-25 00:12:39,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:12:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-25 00:12:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:12:39,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:39,064 INFO L322 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-25 00:12:39,064 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash 840727274, now seen corresponding path program 1 times [2018-01-25 00:12:39,065 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:39,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:39,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:39,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:39,066 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:39,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:39,253 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-25 00:12:39,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:39,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:12:39,253 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:39,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:12:39,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:12:39,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:12:39,254 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-01-25 00:12:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:39,783 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-01-25 00:12:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 00:12:39,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-25 00:12:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:39,785 INFO L225 Difference]: With dead ends: 70 [2018-01-25 00:12:39,785 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:12:39,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-25 00:12:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:12:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-01-25 00:12:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 00:12:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-25 00:12:39,794 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-01-25 00:12:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:39,794 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-25 00:12:39,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:12:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-25 00:12:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:12:39,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:39,796 INFO L322 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-25 00:12:39,796 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash -229619546, now seen corresponding path program 1 times [2018-01-25 00:12:39,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:39,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:39,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:39,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:39,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:39,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:40,043 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-25 00:12:40,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:40,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:12:40,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:40,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:12:40,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:12:40,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:12:40,044 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-01-25 00:12:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:40,304 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-25 00:12:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:12:40,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 00:12:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:40,305 INFO L225 Difference]: With dead ends: 70 [2018-01-25 00:12:40,306 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 00:12:40,306 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:12:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 00:12:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 00:12:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 00:12:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-25 00:12:40,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-01-25 00:12:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:40,313 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-25 00:12:40,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:12:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-25 00:12:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 00:12:40,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:40,315 INFO L322 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-25 00:12:40,315 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1621100812, now seen corresponding path program 1 times [2018-01-25 00:12:40,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:40,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:40,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:40,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:40,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:40,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:40,369 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-25 00:12:40,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:40,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:12:40,370 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:40,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:12:40,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:12:40,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:12:40,371 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-01-25 00:12:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:40,408 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-25 00:12:40,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:12:40,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-25 00:12:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:40,409 INFO L225 Difference]: With dead ends: 77 [2018-01-25 00:12:40,409 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 00:12:40,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 00:12:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 00:12:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 00:12:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-01-25 00:12:40,416 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 34 [2018-01-25 00:12:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:40,416 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-01-25 00:12:40,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:12:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-01-25 00:12:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 00:12:40,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:40,418 INFO L322 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] [2018-01-25 00:12:40,418 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash -945807698, now seen corresponding path program 1 times [2018-01-25 00:12:40,418 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:40,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:40,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:40,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:40,420 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:40,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:12:40,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:40,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:12:40,617 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:40,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:12:40,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:12:40,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:12:40,618 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-01-25 00:12:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:40,743 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-25 00:12:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:12:40,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-25 00:12:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:40,744 INFO L225 Difference]: With dead ends: 54 [2018-01-25 00:12:40,744 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 00:12:40,745 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:12:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 00:12:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 00:12:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 00:12:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-01-25 00:12:40,753 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 40 [2018-01-25 00:12:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:40,753 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-01-25 00:12:40,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:12:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-01-25 00:12:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 00:12:40,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:40,754 INFO L322 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] [2018-01-25 00:12:40,754 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 744732401, now seen corresponding path program 1 times [2018-01-25 00:12:40,754 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:40,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:40,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:40,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:40,756 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:40,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:40,893 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-25 00:12:40,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:40,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 00:12:40,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:40,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 00:12:40,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 00:12:40,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:12:40,894 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-01-25 00:12:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:41,048 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-01-25 00:12:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 00:12:41,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-25 00:12:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:41,049 INFO L225 Difference]: With dead ends: 53 [2018-01-25 00:12:41,049 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 00:12:41,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-01-25 00:12:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 00:12:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 00:12:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 00:12:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-01-25 00:12:41,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 41 [2018-01-25 00:12:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:41,057 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-01-25 00:12:41,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 00:12:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-01-25 00:12:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 00:12:41,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:41,058 INFO L322 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] [2018-01-25 00:12:41,058 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash 744732402, now seen corresponding path program 1 times [2018-01-25 00:12:41,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:41,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:41,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:41,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:41,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:41,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:41,180 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-25 00:12:41,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:41,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 00:12:41,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:41,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 00:12:41,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 00:12:41,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:12:41,181 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-01-25 00:12:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:41,554 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-01-25 00:12:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 00:12:41,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-25 00:12:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:41,554 INFO L225 Difference]: With dead ends: 52 [2018-01-25 00:12:41,555 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 00:12:41,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-01-25 00:12:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 00:12:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 00:12:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 00:12:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-01-25 00:12:41,561 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 41 [2018-01-25 00:12:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:41,561 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-01-25 00:12:41,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 00:12:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-01-25 00:12:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 00:12:41,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:41,562 INFO L322 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] [2018-01-25 00:12:41,562 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 746273508, now seen corresponding path program 1 times [2018-01-25 00:12:41,563 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:41,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:41,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:41,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:41,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:41,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:41,632 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-25 00:12:41,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:41,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:12:41,633 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:41,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:12:41,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:12:41,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:12:41,634 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2018-01-25 00:12:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:41,647 INFO L93 Difference]: Finished difference Result 55 states and 54 transitions. [2018-01-25 00:12:41,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:12:41,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-25 00:12:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:41,648 INFO L225 Difference]: With dead ends: 55 [2018-01-25 00:12:41,648 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 00:12:41,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:12:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 00:12:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 00:12:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 00:12:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2018-01-25 00:12:41,659 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 41 [2018-01-25 00:12:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:41,659 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2018-01-25 00:12:41,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:12:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2018-01-25 00:12:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 00:12:41,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:41,660 INFO L322 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] [2018-01-25 00:12:41,660 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1423792391, now seen corresponding path program 1 times [2018-01-25 00:12:41,661 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:41,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:41,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:41,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:41,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:41,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:41,883 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-25 00:12:41,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:41,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 00:12:41,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:41,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 00:12:41,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 00:12:41,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:12:41,884 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand 14 states. [2018-01-25 00:12:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:42,453 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2018-01-25 00:12:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 00:12:42,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-01-25 00:12:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:42,454 INFO L225 Difference]: With dead ends: 50 [2018-01-25 00:12:42,454 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 00:12:42,454 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-01-25 00:12:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 00:12:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 00:12:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 00:12:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-01-25 00:12:42,459 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 45 [2018-01-25 00:12:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:42,460 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-01-25 00:12:42,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 00:12:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-01-25 00:12:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 00:12:42,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:42,460 INFO L322 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] [2018-01-25 00:12:42,460 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:12:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash -897879172, now seen corresponding path program 1 times [2018-01-25 00:12:42,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:42,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:42,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:42,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:42,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:42,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:42,690 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-25 00:12:42,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:42,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 00:12:42,691 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:42,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 00:12:42,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 00:12:42,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-25 00:12:42,692 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 13 states. [2018-01-25 00:12:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:42,977 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-01-25 00:12:42,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 00:12:42,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-25 00:12:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:42,978 INFO L225 Difference]: With dead ends: 49 [2018-01-25 00:12:42,978 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 00:12:42,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-01-25 00:12:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 00:12:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 00:12:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 00:12:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 00:12:42,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-25 00:12:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:42,980 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 00:12:42,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 00:12:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 00:12:42,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 00:12:42,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 00:12:43,648 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 99 DAG size of output 73 [2018-01-25 00:12:43,706 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-25 00:12:43,706 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-25 00:12:43,706 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-25 00:12:43,706 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-25 00:12:43,706 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 00:12:43,706 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 00:12:43,706 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point L1466(line 1466) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,707 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: (and (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 1 (select |#valid| |~#a6.base|)) (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4)) [2018-01-25 00:12:43,707 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= |old(#length)| |#length|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L397 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|))) (or (not (= 0 |~#a6.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|) 0)) (= 0 .cse0) (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) (not (= (select |#length| |~#a6.base|) 4)) (= |~#a6.base| .cse0) (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 (= 1 (select |old(#valid)| |~#a6.base|))) (= |#valid| |old(#valid)|) (not (= (select |old(#valid)| .cse0) 1)))) [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err3RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-25 00:12:43,708 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err2RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L397 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: (or (let ((.cse0 (@diff |old(#length)| |#length|)) (.cse1 (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (= 1 (select |#valid| .cse1)) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (not (= 0 .cse1)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= (select |old(#valid)| .cse1) 0) (= entry_point_~ret~11 0) (= |#valid| (let ((.cse2 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse2 (select |#valid| .cse2)))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-25 00:12:43,709 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= |old(#length)| |#length|)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4))) [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-25 00:12:43,709 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point probe1_6Err1RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L397 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (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)) (<= (+ probe1_6_~ret~9 1) 0) (= 1 (select |#valid| probe1_6_~p~9.base)) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= (select |#length| probe1_6_~a.base) 4) (= 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 (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L397 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= 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 (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L397 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (and (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-25 00:12:43,710 INFO L401 ceAbstractionStarter]: For program point probe1_6Err2RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point probe1_6Err3RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L397 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: (or (and (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= |#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 (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L397 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: (or (not (= (select (select |old(#memory_$Pointer$.offset)| |~#a6.base|) |~#a6.offset|) 0)) (not (= 0 |~#a6.offset|)) (let ((.cse0 (@diff |old(#length)| |#length|))) (and (= |#length| (store |old(#length)| .cse0 (select |#length| .cse0))) (not (= 0 probe1_6_~p~9.base)) (= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)) (= 1 (select |#valid| probe1_6_~p~9.base)) (= probe1_6_~p~9.offset 0) (= 0 (select |old(#valid)| probe1_6_~p~9.base)) (or (= 0 (select |old(#valid)| .cse0)) (= |old(#length)| |#length|)) (= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (<= 3 probe1_6_~ret~9) (= probe1_6_~a.offset 0) (= |#valid| (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1)))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) 0)) (not (= (select |old(#length)| |probe1_6_#in~a.base|) 4)) (not (= (select |old(#valid)| |probe1_6_#in~a.base|) 1)) (not (= 1 (select |old(#valid)| |~#a6.base|))) (not (= (select |old(#length)| |~#a6.base|) 4)) (not (= 0 |probe1_6_#in~a.offset|))) [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0RequiresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-25 00:12:43,711 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-25 00:12:43,716 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:488) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:219) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) 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-25 00:12:43,720 INFO L168 Benchmark]: Toolchain (without parser) took 7604.59 ms. Allocated memory was 295.2 MB in the beginning and 540.0 MB in the end (delta: 244.8 MB). Free memory was 252.2 MB in the beginning and 361.0 MB in the end (delta: -108.8 MB). Peak memory consumption was 203.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:43,721 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 295.2 MB. Free memory is still 258.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:12:43,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.10 ms. Allocated memory is still 295.2 MB. Free memory was 252.2 MB in the beginning and 238.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:43,722 INFO L168 Benchmark]: Boogie Preprocessor took 35.71 ms. Allocated memory is still 295.2 MB. Free memory was 238.2 MB in the beginning and 236.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:43,722 INFO L168 Benchmark]: RCFGBuilder took 262.91 ms. Allocated memory is still 295.2 MB. Free memory was 236.2 MB in the beginning and 217.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:43,723 INFO L168 Benchmark]: TraceAbstraction took 7078.21 ms. Allocated memory was 295.2 MB in the beginning and 540.0 MB in the end (delta: 244.8 MB). Free memory was 217.6 MB in the beginning and 361.0 MB in the end (delta: -143.4 MB). Peak memory consumption was 168.9 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:43,725 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.21 ms. Allocated memory is still 295.2 MB. Free memory is still 258.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.10 ms. Allocated memory is still 295.2 MB. Free memory was 252.2 MB in the beginning and 238.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.71 ms. Allocated memory is still 295.2 MB. Free memory was 238.2 MB in the beginning and 236.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 262.91 ms. Allocated memory is still 295.2 MB. Free memory was 236.2 MB in the beginning and 217.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7078.21 ms. Allocated memory was 295.2 MB in the beginning and 540.0 MB in the end (delta: 244.8 MB). Free memory was 217.6 MB in the beginning and 361.0 MB in the end (delta: -143.4 MB). Peak memory consumption was 168.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 1476]: 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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 13 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_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-12-43-733.csv Received shutdown request...