java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:24:44,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:24:44,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:24:44,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:24:44,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:24:44,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:24:44,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:24:44,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:24:44,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:24:44,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:24:44,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:24:44,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:24:44,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:24:44,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:24:44,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:24:44,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:24:44,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:24:44,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:24:44,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:24:44,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:24:44,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:24:44,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:24:44,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:24:44,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:24:44,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:24:44,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:24:44,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:24:44,531 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:24:44,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:24:44,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:24:44,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:24:44,533 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:24:44,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:24:44,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:24:44,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:24:44,544 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:24:44,544 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:24:44,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:24:44,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:24:44,544 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:24:44,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:24:44,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:24:44,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:24:44,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:24:44,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:24:44,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:24:44,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:24:44,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:24:44,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:24:44,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:24:44,584 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:24:44,587 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:24:44,588 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:24:44,588 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:24:44,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-04 03:24:44,739 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:24:44,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:24:44,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:44,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:24:44,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:24:44,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44, skipping insertion in model container [2018-02-04 03:24:44,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:44,809 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:44,901 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:44,917 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:44,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44 WrapperNode [2018-02-04 03:24:44,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:44,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:24:44,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:24:44,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:24:44,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... [2018-02-04 03:24:44,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:24:44,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:24:44,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:24:44,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:24:44,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:24:44,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:24:44,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:24:44,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:24:44,997 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 03:24:44,997 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 03:24:44,998 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 03:24:44,998 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 03:24:44,998 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:24:44,998 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:24:44,998 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:24:44,999 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:24:45,170 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:24:45,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:45 BoogieIcfgContainer [2018-02-04 03:24:45,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:24:45,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:24:45,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:24:45,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:24:45,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:24:44" (1/3) ... [2018-02-04 03:24:45,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6805076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:45, skipping insertion in model container [2018-02-04 03:24:45,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:44" (2/3) ... [2018-02-04 03:24:45,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6805076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:45, skipping insertion in model container [2018-02-04 03:24:45,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:45" (3/3) ... [2018-02-04 03:24:45,175 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-04 03:24:45,180 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:24:45,185 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 03:24:45,210 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:24:45,211 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:24:45,211 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:24:45,211 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:24:45,211 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:24:45,211 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:24:45,211 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:24:45,212 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:24:45,212 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:24:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-04 03:24:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:24:45,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:45,236 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:45,237 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:45,241 INFO L82 PathProgramCache]: Analyzing trace with hash -554404132, now seen corresponding path program 1 times [2018-02-04 03:24:45,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:45,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:45,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:45,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,454 INFO L182 omatonBuilderFactory]: Interpolants [65#true, 66#false, 67#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 68#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 69#(and (= probe1_6_~p~0.base 0) (= 0 probe1_6_~p~0.offset))] [2018-02-04 03:24:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:45,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:45,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:45,517 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-02-04 03:24:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:45,564 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 03:24:45,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:45,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 03:24:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:45,576 INFO L225 Difference]: With dead ends: 68 [2018-02-04 03:24:45,576 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 03:24:45,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 03:24:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-02-04 03:24:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 03:24:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-04 03:24:45,610 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2018-02-04 03:24:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:45,610 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-04 03:24:45,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-04 03:24:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:24:45,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:45,612 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:45,612 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293187, now seen corresponding path program 1 times [2018-02-04 03:24:45,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:45,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:45,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:45,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:45,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-02-04 03:24:45,691 INFO L182 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(= 1 (select |#valid| |entry_point_~#a7~0.base|)), 204#(= |#valid| |old(#valid)|), 205#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 206#(= 1 (select |#valid| disconnect_6_~a.base))] [2018-02-04 03:24:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:45,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:45,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:45,693 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-02-04 03:24:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:45,845 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 03:24:45,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:24:45,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 03:24:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:45,847 INFO L225 Difference]: With dead ends: 75 [2018-02-04 03:24:45,847 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 03:24:45,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:24:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 03:24:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-02-04 03:24:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:24:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 03:24:45,856 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-02-04 03:24:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:45,856 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 03:24:45,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 03:24:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:24:45,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:45,858 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:45,858 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293188, now seen corresponding path program 1 times [2018-02-04 03:24:45,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:45,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:45,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:45,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,923 INFO L182 omatonBuilderFactory]: Interpolants [358#true, 359#false, 360#(<= 3 probe1_6_~ret~0), 361#(<= 3 |probe1_6_#res|), 362#(<= 3 |entry_point_#t~ret9|), 363#(<= 3 entry_point_~ret~1)] [2018-02-04 03:24:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:45,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:45,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:45,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:45,924 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2018-02-04 03:24:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:45,966 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 03:24:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:45,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 03:24:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:45,967 INFO L225 Difference]: With dead ends: 75 [2018-02-04 03:24:45,968 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 03:24:45,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 03:24:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-02-04 03:24:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 03:24:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-02-04 03:24:45,973 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-02-04 03:24:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:45,973 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-02-04 03:24:45,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-02-04 03:24:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:24:45,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:45,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:45,974 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash 787364094, now seen corresponding path program 1 times [2018-02-04 03:24:45,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:45,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:46,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:46,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,028 INFO L182 omatonBuilderFactory]: Interpolants [512#(= 0 |probe1_6_#t~ret4.offset|), 513#(= 0 probe1_6_~p~0.offset), 508#true, 509#false, 510#(= 0 |ldv_malloc_#t~malloc1.offset|), 511#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 03:24:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:46,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:46,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:46,029 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-02-04 03:24:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:46,051 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-04 03:24:46,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:24:46,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 03:24:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:46,052 INFO L225 Difference]: With dead ends: 66 [2018-02-04 03:24:46,052 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 03:24:46,053 INFO L554 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-02-04 03:24:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 03:24:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 03:24:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 03:24:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-04 03:24:46,057 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 25 [2018-02-04 03:24:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:46,058 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-04 03:24:46,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-04 03:24:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:24:46,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:46,059 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:46,059 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 787364095, now seen corresponding path program 1 times [2018-02-04 03:24:46,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:46,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:46,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:46,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,103 INFO L182 omatonBuilderFactory]: Interpolants [648#true, 649#false, 650#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 651#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 652#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 653#(= 1 (select |#valid| probe1_6_~p~0.base))] [2018-02-04 03:24:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:46,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:46,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:46,103 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-04 03:24:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:46,168 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-04 03:24:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:46,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 03:24:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:46,169 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:24:46,169 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:24:46,169 INFO L554 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-02-04 03:24:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:24:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-02-04 03:24:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 03:24:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 03:24:46,174 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-02-04 03:24:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:46,175 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 03:24:46,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 03:24:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:24:46,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:46,176 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:46,176 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1459091407, now seen corresponding path program 1 times [2018-02-04 03:24:46,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:46,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:46,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:24:46,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,267 INFO L182 omatonBuilderFactory]: Interpolants [790#true, 791#false, 792#(= |#valid| |old(#valid)|), 793#(and (= |#valid| (store |old(#valid)| |entry_point_~#a7~0.base| (select |#valid| |entry_point_~#a7~0.base|))) (= (select |old(#valid)| |entry_point_~#a7~0.base|) 0))] [2018-02-04 03:24:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:24:46,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:24:46,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:24:46,267 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-02-04 03:24:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:46,343 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-02-04 03:24:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:46,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-04 03:24:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:46,344 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:24:46,345 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 03:24:46,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 03:24:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 03:24:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:24:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-04 03:24:46,349 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 25 [2018-02-04 03:24:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:46,349 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-04 03:24:46,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:24:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-04 03:24:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:24:46,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:46,350 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:46,350 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1886799503, now seen corresponding path program 1 times [2018-02-04 03:24:46,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:46,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:46,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:46,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:46,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-02-04 03:24:46,387 INFO L182 omatonBuilderFactory]: Interpolants [931#true, 932#false, 933#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 934#(not (= 0 |ldv_malloc_#res.base|)), 935#(not (= 0 |probe1_6_#t~ret4.base|)), 936#(not (= 0 probe1_6_~p~0.base))] [2018-02-04 03:24:46,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-02-04 03:24:46,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:46,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:46,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:46,388 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-02-04 03:24:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:46,414 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 03:24:46,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:46,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 03:24:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:46,415 INFO L225 Difference]: With dead ends: 57 [2018-02-04 03:24:46,415 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 03:24:46,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 03:24:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 03:24:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 03:24:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 03:24:46,418 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2018-02-04 03:24:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:46,420 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 03:24:46,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 03:24:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:24:46,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:46,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:46,421 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash 725932211, now seen corresponding path program 1 times [2018-02-04 03:24:46,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:46,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:46,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:24:46,516 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,517 INFO L182 omatonBuilderFactory]: Interpolants [1056#(= 1 (select |#valid| |probe1_6_#in~a.base|)), 1057#(= 1 (select |#valid| probe1_6_~a.base)), 1058#(= |#valid| |old(#valid)|), 1059#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 1060#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1053#true, 1054#false, 1055#(= 1 (select |#valid| |entry_point_~#a7~0.base|))] [2018-02-04 03:24:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:24:46,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:24:46,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:24:46,518 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-02-04 03:24:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:46,698 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-02-04 03:24:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:24:46,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 03:24:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:46,700 INFO L225 Difference]: With dead ends: 62 [2018-02-04 03:24:46,700 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 03:24:46,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 03:24:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-02-04 03:24:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 03:24:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 03:24:46,707 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-02-04 03:24:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:46,707 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 03:24:46,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:24:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 03:24:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:24:46,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:46,708 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:46,708 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash 725932212, now seen corresponding path program 1 times [2018-02-04 03:24:46,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:46,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:46,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:24:46,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,822 INFO L182 omatonBuilderFactory]: Interpolants [1187#true, 1188#false, 1189#(and (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= 0 |entry_point_~#a7~0.offset|) (= 4 (select |#length| |entry_point_~#a7~0.base|))), 1190#(and (= (select |#valid| |probe1_6_#in~a.base|) 1) (= 4 (select |#length| |probe1_6_#in~a.base|)) (= 0 |probe1_6_#in~a.offset|)), 1191#(and (= (select |#valid| probe1_6_~a.base) 1) (= probe1_6_~a.offset 0) (= 4 (select |#length| probe1_6_~a.base))), 1192#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1193#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 1194#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 1195#(and (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~a.offset 0))] [2018-02-04 03:24:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:46,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:24:46,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:24:46,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:24:46,823 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-02-04 03:24:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:47,039 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 03:24:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:47,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 03:24:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:47,041 INFO L225 Difference]: With dead ends: 57 [2018-02-04 03:24:47,041 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 03:24:47,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:24:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 03:24:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-02-04 03:24:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 03:24:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-04 03:24:47,045 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-02-04 03:24:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:47,045 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-04 03:24:47,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:24:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-04 03:24:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:24:47,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:47,046 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:47,046 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2094593310, now seen corresponding path program 1 times [2018-02-04 03:24:47,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:47,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:47,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:47,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,086 INFO L182 omatonBuilderFactory]: Interpolants [1318#true, 1319#false, 1320#(<= (+ probe1_6_~ret~0 1) 0), 1321#(<= (+ |probe1_6_#res| 1) 0), 1322#(<= (+ |entry_point_#t~ret9| 1) 0), 1323#(<= (+ entry_point_~ret~1 1) 0)] [2018-02-04 03:24:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:47,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:47,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:47,087 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2018-02-04 03:24:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:47,113 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 03:24:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:47,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 03:24:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:47,114 INFO L225 Difference]: With dead ends: 63 [2018-02-04 03:24:47,114 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 03:24:47,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 03:24:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-02-04 03:24:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 03:24:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 03:24:47,118 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-02-04 03:24:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:47,118 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 03:24:47,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 03:24:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:24:47,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:47,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:47,119 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1386851478, now seen corresponding path program 1 times [2018-02-04 03:24:47,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:47,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:47,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:24:47,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,326 INFO L182 omatonBuilderFactory]: Interpolants [1456#(and (= (select (store |#valid| |entry_point_~#a7~0.base| 0) |entry_point_~#a7~0.base|) (select |old(#valid)| |entry_point_~#a7~0.base|)) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 1448#true, 1449#false, 1450#(= |#valid| |old(#valid)|), 1451#(and (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 1452#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 1453#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 1454#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= (store |#valid| |probe1_6_#t~ret4.base| 0) |old(#valid)|)), 1455#(and (= |old(#valid)| (store |#valid| probe1_6_~p~0.base 0)) (not (= 0 probe1_6_~p~0.base)))] [2018-02-04 03:24:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:24:47,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:24:47,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:24:47,327 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2018-02-04 03:24:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:47,520 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-04 03:24:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:47,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 03:24:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:47,521 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:24:47,521 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 03:24:47,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 03:24:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 03:24:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 03:24:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 03:24:47,523 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 35 [2018-02-04 03:24:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:47,524 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 03:24:47,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:24:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 03:24:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:24:47,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:47,525 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:47,527 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935703, now seen corresponding path program 1 times [2018-02-04 03:24:47,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:47,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:47,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:47,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,565 INFO L182 omatonBuilderFactory]: Interpolants [1584#(= 1 (select |#valid| |entry_point_~#a7~0.base|)), 1585#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 1586#(= 1 (select |#valid| disconnect_6_~a.base)), 1580#true, 1581#false, 1582#(= probe1_6_~a.base |probe1_6_#in~a.base|), 1583#(= 1 (select |#valid| |probe1_6_#in~a.base|))] [2018-02-04 03:24:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:24:47,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:24:47,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:24:47,565 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 7 states. [2018-02-04 03:24:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:47,610 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 03:24:47,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:24:47,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 03:24:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:47,612 INFO L225 Difference]: With dead ends: 53 [2018-02-04 03:24:47,612 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 03:24:47,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:24:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 03:24:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-02-04 03:24:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 03:24:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-04 03:24:47,614 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 39 [2018-02-04 03:24:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:47,614 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-04 03:24:47,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:24:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-04 03:24:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:24:47,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:47,615 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:47,615 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935704, now seen corresponding path program 1 times [2018-02-04 03:24:47,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:47,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:47,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:24:47,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,706 INFO L182 omatonBuilderFactory]: Interpolants [1696#true, 1697#false, 1698#(= 0 |entry_point_~#a7~0.offset|), 1699#(and (or (= probe1_6_~a.base |probe1_6_#in~a.base|) (not (= probe1_6_~a.offset 0))) (or (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= probe1_6_~a.offset 0))), 1700#(or (<= 4 (select |#length| |probe1_6_#in~a.base|)) (not (= 0 |probe1_6_#in~a.offset|))), 1701#(and (= 0 |entry_point_~#a7~0.offset|) (<= 4 (select |#length| |entry_point_~#a7~0.base|))), 1702#(and (= 0 |disconnect_6_#in~a.offset|) (<= 4 (select |#length| |disconnect_6_#in~a.base|))), 1703#(and (<= 4 (select |#length| disconnect_6_~a.base)) (= disconnect_6_~a.offset 0))] [2018-02-04 03:24:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:24:47,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:24:47,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:24:47,707 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-02-04 03:24:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:47,779 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 03:24:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:24:47,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 03:24:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:47,780 INFO L225 Difference]: With dead ends: 51 [2018-02-04 03:24:47,780 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 03:24:47,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 03:24:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 03:24:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 03:24:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-04 03:24:47,782 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-02-04 03:24:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:47,782 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-04 03:24:47,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:24:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-04 03:24:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:24:47,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:47,783 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:47,783 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502653, now seen corresponding path program 1 times [2018-02-04 03:24:47,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:47,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:47,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:24:47,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,856 INFO L182 omatonBuilderFactory]: Interpolants [1810#true, 1811#false, 1812#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 1813#(= 0 |ldv_malloc_#t~malloc1.offset|), 1814#(= 0 |ldv_malloc_#res.offset|), 1815#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= 0 |probe1_6_#t~ret4.offset|)), 1816#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 probe1_6_~p~0.offset) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 1817#(= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)), 1818#(= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|)), 1819#(= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)), 1820#(= 0 (select (select |#memory_$Pointer$.offset| disconnect_6_~a.base) disconnect_6_~a.offset)), 1821#(= |disconnect_6_#t~mem8.offset| 0)] [2018-02-04 03:24:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:47,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:24:47,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:24:47,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:47,857 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2018-02-04 03:24:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:47,915 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 03:24:47,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:24:47,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 03:24:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:47,916 INFO L225 Difference]: With dead ends: 50 [2018-02-04 03:24:47,916 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:24:47,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:24:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:24:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 03:24:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 03:24:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-04 03:24:47,917 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2018-02-04 03:24:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:47,918 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-04 03:24:47,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:24:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-04 03:24:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:24:47,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:47,918 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:47,918 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502652, now seen corresponding path program 1 times [2018-02-04 03:24:47,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:47,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:48,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:24:48,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,028 INFO L182 omatonBuilderFactory]: Interpolants [1936#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= 1 (select |#valid| probe1_6_~p~0.base))), 1937#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))), 1938#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))), 1939#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))), 1940#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_6_~a.base) disconnect_6_~a.offset))), 1941#(= 1 (select |#valid| |disconnect_6_#t~mem8.base|)), 1930#true, 1931#false, 1932#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 1933#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1934#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1935#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 1 (select |#valid| |probe1_6_#t~ret4.base|)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|))] [2018-02-04 03:24:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:24:48,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:24:48,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:48,029 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 12 states. [2018-02-04 03:24:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:48,137 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 03:24:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:24:48,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 03:24:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:48,138 INFO L225 Difference]: With dead ends: 50 [2018-02-04 03:24:48,138 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:24:48,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:24:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:24:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 03:24:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 03:24:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-04 03:24:48,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2018-02-04 03:24:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:48,140 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-04 03:24:48,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:24:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-04 03:24:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:24:48,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:48,141 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:48,141 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash 901697635, now seen corresponding path program 1 times [2018-02-04 03:24:48,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:48,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:48,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:48,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,164 INFO L182 omatonBuilderFactory]: Interpolants [2049#true, 2050#false, 2051#(= 0 |probe1_6_#res|), 2052#(= 0 |entry_point_#t~ret9|), 2053#(= entry_point_~ret~1 0)] [2018-02-04 03:24:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:48,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:48,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:48,165 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-02-04 03:24:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:48,169 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-04 03:24:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:48,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 03:24:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:48,171 INFO L225 Difference]: With dead ends: 49 [2018-02-04 03:24:48,171 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 03:24:48,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 03:24:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 03:24:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 03:24:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-04 03:24:48,173 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 41 [2018-02-04 03:24:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:48,173 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-04 03:24:48,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-04 03:24:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:24:48,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:48,175 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:48,175 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:24:48,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1792979891, now seen corresponding path program 1 times [2018-02-04 03:24:48,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:48,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:48,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 03:24:48,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,447 INFO L182 omatonBuilderFactory]: Interpolants [2152#true, 2153#false, 2154#(= |#valid| |old(#valid)|), 2155#(and (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 2156#(and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2157#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 2158#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 2159#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 (select |old(#valid)| |probe1_6_#t~ret4.base|)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= |old(#valid)| (store |#valid| |probe1_6_#t~ret4.base| (select |old(#valid)| |probe1_6_#t~ret4.base|)))), 2160#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 (select |old(#valid)| probe1_6_~p~0.base)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= (store |#valid| probe1_6_~p~0.base (select |old(#valid)| probe1_6_~p~0.base)) |old(#valid)|) (not (= 0 probe1_6_~p~0.base))), 2161#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)))), 2162#(and (not (= 0 (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))) (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (not (= |entry_point_~#a7~0.base| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))) (= (store (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)) (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|)))), 2163#(and (= disconnect_6_~a.offset |disconnect_6_#in~a.offset|) (= disconnect_6_~a.base |disconnect_6_#in~a.base|) (= |#valid| |old(#valid)|)), 2164#(and (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) |disconnect_6_#t~mem8.base|)), 2165#(or (= 0 (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) 0) (= (store |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))) |old(#valid)|))), 2166#(and (= (select (store |#valid| |entry_point_~#a7~0.base| 0) |entry_point_~#a7~0.base|) (select |old(#valid)| |entry_point_~#a7~0.base|)) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|))))] [2018-02-04 03:24:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:48,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:24:48,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:24:48,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:24:48,447 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 15 states. [2018-02-04 03:24:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:48,696 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-04 03:24:48,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:24:48,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-04 03:24:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:48,696 INFO L225 Difference]: With dead ends: 48 [2018-02-04 03:24:48,696 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:24:48,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:24:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:24:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:24:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:24:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:24:48,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-04 03:24:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:48,697 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:24:48,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:24:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:24:48,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:24:48,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:24:48 BoogieIcfgContainer [2018-02-04 03:24:48,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:24:48,701 INFO L168 Benchmark]: Toolchain (without parser) took 3960.84 ms. Allocated memory was 403.2 MB in the beginning and 690.5 MB in the end (delta: 287.3 MB). Free memory was 360.0 MB in the beginning and 541.7 MB in the end (delta: -181.7 MB). Peak memory consumption was 105.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:48,702 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:48,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.24 ms. Allocated memory is still 403.2 MB. Free memory was 360.0 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:48,702 INFO L168 Benchmark]: Boogie Preprocessor took 29.28 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 345.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:48,702 INFO L168 Benchmark]: RCFGBuilder took 215.69 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 324.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:48,702 INFO L168 Benchmark]: TraceAbstraction took 3529.56 ms. Allocated memory was 403.2 MB in the beginning and 690.5 MB in the end (delta: 287.3 MB). Free memory was 324.8 MB in the beginning and 541.7 MB in the end (delta: -216.8 MB). Peak memory consumption was 70.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:48,703 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.14 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 183.24 ms. Allocated memory is still 403.2 MB. Free memory was 360.0 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.28 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 345.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 215.69 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 324.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3529.56 ms. Allocated memory was 403.2 MB in the beginning and 690.5 MB in the end (delta: 287.3 MB). Free memory was 324.8 MB in the beginning and 541.7 MB in the end (delta: -216.8 MB). Peak memory consumption was 70.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 3.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 304 SDslu, 2992 SDs, 0 SdLazy, 1582 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 96128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-24-48-710.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-24-48-710.csv Received shutdown request...