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/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:45:34,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:45:34,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:45:34,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:45:34,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:45:34,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:45:34,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:45:34,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:45:34,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:45:34,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:45:34,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:45:34,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:45:34,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:45:34,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:45:34,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:45:34,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:45:34,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:45:34,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:45:34,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:45:34,994 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:45:34,996 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:45:34,996 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:45:34,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:45:34,997 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:45:34,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:45:34,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:45:34,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:45:34,999 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:45:34,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:45:34,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:45:35,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:45:35,000 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 01:45:35,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:45:35,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:45:35,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:45:35,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:45:35,011 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:45:35,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:45:35,011 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:45:35,011 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:45:35,012 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:45:35,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:45:35,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:45:35,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:45:35,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:45:35,013 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:45:35,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:35,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:45:35,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:45:35,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:45:35,056 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:45:35,059 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:45:35,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:45:35,061 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:45:35,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:35,198 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:45:35,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:45:35,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:35,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:45:35,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:45:35,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d684dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35, skipping insertion in model container [2018-02-04 01:45:35,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,223 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:35,251 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:35,340 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:35,351 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:35,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35 WrapperNode [2018-02-04 01:45:35,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:35,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:45:35,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:45:35,357 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:45:35,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (1/1) ... [2018-02-04 01:45:35,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:45:35,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:45:35,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:45:35,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:45:35,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (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 01:45:35,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:45:35,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:45:35,419 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-02-04 01:45:35,419 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:45:35,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:45:35,520 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:45:35,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:35 BoogieIcfgContainer [2018-02-04 01:45:35,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:45:35,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:45:35,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:45:35,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:45:35,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:45:35" (1/3) ... [2018-02-04 01:45:35,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c755c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:35, skipping insertion in model container [2018-02-04 01:45:35,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:35" (2/3) ... [2018-02-04 01:45:35,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c755c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:35, skipping insertion in model container [2018-02-04 01:45:35,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:35" (3/3) ... [2018-02-04 01:45:35,525 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:35,530 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:45:35,535 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 01:45:35,558 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:45:35,558 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:45:35,558 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:45:35,558 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:45:35,558 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:45:35,558 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:45:35,558 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:45:35,559 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:45:35,559 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:45:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 01:45:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:45:35,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:35,580 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:35,580 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-02-04 01:45:35,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:35,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:35,732 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 01:45:35,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:35,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:45:35,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:35,735 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 01:45:35,736 INFO L182 omatonBuilderFactory]: Interpolants [32#true, 33#false, 34#(<= 1 main_~length~0), 35#(<= main_~n~0 main_~length~0)] [2018-02-04 01:45:35,736 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 01:45:35,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:45:35,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:45:35,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:35,750 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-02-04 01:45:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:35,811 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 01:45:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:45:35,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 01:45:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:35,818 INFO L225 Difference]: With dead ends: 33 [2018-02-04 01:45:35,819 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 01:45:35,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 01:45:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 01:45:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 01:45:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 01:45:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-02-04 01:45:35,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-02-04 01:45:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:35,902 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-02-04 01:45:35,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:45:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-02-04 01:45:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:45:35,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:35,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:35,903 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-02-04 01:45:35,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:35,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:35,928 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 01:45:35,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:35,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:45:35,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:35,929 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 01:45:35,929 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(= |#valid| |old(#valid)|)] [2018-02-04 01:45:35,929 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 01:45:35,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:45:35,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:45:35,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:45:35,931 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-02-04 01:45:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:35,945 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-02-04 01:45:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:45:35,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 01:45:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:35,946 INFO L225 Difference]: With dead ends: 28 [2018-02-04 01:45:35,946 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 01:45:35,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:45:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 01:45:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-02-04 01:45:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 01:45:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-04 01:45:35,951 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-04 01:45:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:35,952 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-04 01:45:35,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:45:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-04 01:45:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:45:35,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:35,952 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:35,952 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-02-04 01:45:35,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:35,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:36,032 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 01:45:36,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:36,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:45:36,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:36,033 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 01:45:36,033 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| cbzero_~p~0.base)), 161#(= 1 (select |#valid| |cbzero_#t~post1.base|)), 155#true, 156#false, 157#(= 1 (select |#valid| |main_#t~malloc5.base|)), 158#(= 1 (select |#valid| main_~nondetArea~0.base)), 159#(= 1 (select |#valid| |cbzero_#in~b.base|))] [2018-02-04 01:45:36,033 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 01:45:36,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:45:36,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:45:36,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:45:36,034 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-02-04 01:45:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:36,101 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-04 01:45:36,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:45:36,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-04 01:45:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:36,102 INFO L225 Difference]: With dead ends: 25 [2018-02-04 01:45:36,102 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 01:45:36,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 01:45:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 01:45:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 01:45:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-04 01:45:36,104 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-02-04 01:45:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:36,104 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-04 01:45:36,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:45:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-04 01:45:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:45:36,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:36,105 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:36,105 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:36,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-02-04 01:45:36,105 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:36,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:36,251 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 01:45:36,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:36,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:36,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:36,251 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 01:45:36,252 INFO L182 omatonBuilderFactory]: Interpolants [224#(and (= 0 cbzero_~p~0.offset) (<= 1 (select |#length| cbzero_~p~0.base))), 225#(and (<= 1 (select |#length| |cbzero_#t~post1.base|)) (= |cbzero_#t~post1.offset| 0)), 218#true, 219#false, 220#(<= 1 main_~length~0), 221#(and (= 0 |main_#t~malloc5.offset|) (<= 1 (select |#length| |main_#t~malloc5.base|))), 222#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 223#(and (<= 1 (select |#length| |cbzero_#in~b.base|)) (= 0 |cbzero_#in~b.offset|))] [2018-02-04 01:45:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:36,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:36,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:36,252 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-02-04 01:45:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:36,338 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-04 01:45:36,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:36,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 01:45:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:36,341 INFO L225 Difference]: With dead ends: 31 [2018-02-04 01:45:36,342 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 01:45:36,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 01:45:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-02-04 01:45:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 01:45:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 01:45:36,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 01:45:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:36,346 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 01:45:36,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 01:45:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:45:36,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:36,347 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:36,347 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-02-04 01:45:36,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:36,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:36,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 01:45:36,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:36,438 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 01:45:36,438 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 298#(and (<= |cbzero_#in~length| 1) (<= 1 |cbzero_#in~length|)), 299#(and (<= cbzero_~length 1) (<= 1 cbzero_~length)), 300#(and (<= cbzero_~length 0) (<= 0 cbzero_~length)), 301#(and (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1)))] [2018-02-04 01:45:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:45:36,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:45:36,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:45:36,439 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2018-02-04 01:45:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:36,492 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 01:45:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:45:36,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 01:45:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:36,494 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:45:36,494 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:45:36,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:45:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-04 01:45:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:45:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 01:45:36,498 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-04 01:45:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:36,498 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 01:45:36,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:45:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 01:45:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:45:36,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:36,499 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:36,499 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-02-04 01:45:36,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:36,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:36,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:45:36,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:36,592 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 01:45:36,592 INFO L182 omatonBuilderFactory]: Interpolants [400#(and (<= main_~length~0 1) (<= 1 main_~n~0)), 401#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 402#(and (<= |cbzero_#in~length| 1) (<= 1 |cbzero_#in~length|)), 403#(and (<= cbzero_~length 1) (<= 1 cbzero_~length)), 404#(and (<= cbzero_~length 0) (<= 0 cbzero_~length)), 405#(and (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1))), 397#true, 398#false, 399#(<= main_~length~0 1)] [2018-02-04 01:45:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:45:36,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:45:36,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:36,593 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2018-02-04 01:45:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:36,680 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 01:45:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:45:36,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 01:45:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:36,681 INFO L225 Difference]: With dead ends: 73 [2018-02-04 01:45:36,681 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 01:45:36,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 01:45:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-02-04 01:45:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:45:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 01:45:36,689 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-04 01:45:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:36,689 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 01:45:36,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:45:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 01:45:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:45:36,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:36,690 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:36,690 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-02-04 01:45:36,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:36,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:36,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:45:36,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:36,882 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 01:45:36,882 INFO L182 omatonBuilderFactory]: Interpolants [529#true, 530#false, 531#(<= 1 main_~n~0), 532#(and (<= main_~n~0 main_~length~0) (<= 1 main_~n~0)), 533#(and (= 0 |main_#t~malloc5.offset|) (<= main_~n~0 (select |#length| |main_#t~malloc5.base|)) (<= 1 main_~n~0)), 534#(and (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset) (<= main_~n~0 (select |#length| main_~nondetArea~0.base))), 535#(and (<= |cbzero_#in~length| (select |#length| |cbzero_#in~b.base|)) (= 0 |cbzero_#in~b.offset|) (<= 1 |cbzero_#in~length|)), 536#(and (= 0 cbzero_~p~0.offset) (<= cbzero_~length (select |#length| cbzero_~p~0.base)) (<= 1 cbzero_~length)), 537#(and (= 0 cbzero_~p~0.offset) (<= 0 cbzero_~length) (<= (+ cbzero_~length 1) (select |#length| cbzero_~p~0.base))), 538#(and (<= (+ cbzero_~length cbzero_~p~0.offset) (+ |cbzero_#t~post1.offset| (select |#length| cbzero_~p~0.base))) (<= (+ |cbzero_#t~post1.offset| 1) cbzero_~p~0.offset) (= |cbzero_#t~post1.offset| 0) (<= 0 cbzero_~length)), 539#(and (<= 1 cbzero_~p~0.offset) (<= (+ cbzero_~length cbzero_~p~0.offset) (select |#length| cbzero_~p~0.base)) (<= 0 cbzero_~length)), 540#(and (<= 1 cbzero_~p~0.offset) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1)) (or (<= (+ cbzero_~p~0.offset |cbzero_#t~post0|) (select |#length| cbzero_~p~0.base)) (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))))), 541#(and (<= 1 |cbzero_#t~post1.offset|) (<= (+ |cbzero_#t~post1.offset| 1) (select |#length| |cbzero_#t~post1.base|)))] [2018-02-04 01:45:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:36,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:45:36,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:45:36,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:36,884 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-02-04 01:45:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:37,073 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-04 01:45:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:45:37,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-04 01:45:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:37,074 INFO L225 Difference]: With dead ends: 51 [2018-02-04 01:45:37,075 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 01:45:37,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:45:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 01:45:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 01:45:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:45:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 01:45:37,078 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-02-04 01:45:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:37,078 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 01:45:37,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:45:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 01:45:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:45:37,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:37,078 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] [2018-02-04 01:45:37,078 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-02-04 01:45:37,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:37,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:37,137 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 01:45:37,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:37,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:45:37,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:37,138 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 01:45:37,138 INFO L182 omatonBuilderFactory]: Interpolants [657#true, 658#false, 659#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 660#(and (<= |cbzero_#in~length| cbzero_~length) (<= cbzero_~length |cbzero_#in~length|)), 661#(and (or (< 0 (div |cbzero_#t~post0| 4294967296)) (<= |cbzero_#in~length| |cbzero_#t~post0|)) (or (<= |cbzero_#t~post0| |cbzero_#in~length|) (<= (div |cbzero_#t~post0| 4294967296) 0))), 662#(or (<= 4294967296 |cbzero_#in~length|) (<= |cbzero_#in~length| 0))] [2018-02-04 01:45:37,138 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 01:45:37,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:37,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:37,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:37,139 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-02-04 01:45:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:37,169 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 01:45:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:37,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 01:45:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:37,171 INFO L225 Difference]: With dead ends: 59 [2018-02-04 01:45:37,171 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 01:45:37,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 01:45:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-02-04 01:45:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 01:45:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 01:45:37,176 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-02-04 01:45:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:37,176 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 01:45:37,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 01:45:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:45:37,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:37,178 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] [2018-02-04 01:45:37,178 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:37,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-02-04 01:45:37,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:37,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:37,228 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 01:45:37,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:37,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:45:37,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:37,228 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 01:45:37,229 INFO L182 omatonBuilderFactory]: Interpolants [774#true, 775#false, 776#(= |#valid| |old(#valid)|), 777#(= (store |#valid| |main_#t~malloc5.base| (select (store |#valid| |main_#t~malloc5.base| 0) |main_#t~malloc5.base|)) |old(#valid)|)] [2018-02-04 01:45:37,229 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 01:45:37,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:45:37,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:45:37,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:37,229 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 4 states. [2018-02-04 01:45:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:37,252 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-02-04 01:45:37,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:45:37,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 01:45:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:37,253 INFO L225 Difference]: With dead ends: 51 [2018-02-04 01:45:37,253 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 01:45:37,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 01:45:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 01:45:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 01:45:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 01:45:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-02-04 01:45:37,255 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-02-04 01:45:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:37,255 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-02-04 01:45:37,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:45:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-02-04 01:45:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:45:37,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:37,256 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:37,256 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 964772623, now seen corresponding path program 2 times [2018-02-04 01:45:37,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:37,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:37,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:37,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:45:37,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:37,495 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 01:45:37,495 INFO L182 omatonBuilderFactory]: Interpolants [864#(and (= 0 cbzero_~p~0.offset) (<= 0 cbzero_~length) (<= (+ cbzero_~length 1) (select |#length| cbzero_~p~0.base))), 865#(and (<= (+ cbzero_~length cbzero_~p~0.offset) (+ |cbzero_#t~post1.offset| (select |#length| cbzero_~p~0.base))) (<= (+ |cbzero_#t~post1.offset| 1) cbzero_~p~0.offset) (= |cbzero_#t~post1.offset| 0) (<= 0 cbzero_~length)), 866#(and (<= 1 cbzero_~p~0.offset) (<= (+ cbzero_~length cbzero_~p~0.offset) (select |#length| cbzero_~p~0.base)) (<= 0 cbzero_~length)), 867#(and (<= (+ cbzero_~length cbzero_~p~0.offset 1) (select |#length| cbzero_~p~0.base)) (or (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))) (<= |cbzero_#t~post0| (+ cbzero_~length 1))) (<= 1 cbzero_~p~0.offset) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1))), 868#(and (<= 2 cbzero_~p~0.offset) (<= (* 4294967296 (div (+ cbzero_~length (+ cbzero_~p~0.offset (+ (- (select |#length| |cbzero_#t~post1.base|)) 4294967295))) 4294967296)) cbzero_~length) (= |cbzero_#t~post1.base| cbzero_~p~0.base)), 869#(and (<= (* 4294967296 (div (+ cbzero_~length (+ cbzero_~p~0.offset (+ (- (select |#length| cbzero_~p~0.base)) 4294967295))) 4294967296)) cbzero_~length) (<= 2 cbzero_~p~0.offset)), 870#(and (or (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))) (<= (+ cbzero_~p~0.offset |cbzero_#t~post0|) (+ (* 4294967296 (div |cbzero_#t~post0| 4294967296)) (select |#length| cbzero_~p~0.base)))) (<= 2 cbzero_~p~0.offset)), 871#(and (<= 2 |cbzero_#t~post1.offset|) (<= (+ |cbzero_#t~post1.offset| 1) (select |#length| |cbzero_#t~post1.base|))), 856#true, 857#false, 858#(<= 1 main_~n~0), 859#(and (<= main_~n~0 main_~length~0) (<= 1 main_~n~0)), 860#(and (= 0 |main_#t~malloc5.offset|) (<= main_~n~0 (select |#length| |main_#t~malloc5.base|)) (<= 1 main_~n~0)), 861#(and (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset) (<= main_~n~0 (select |#length| main_~nondetArea~0.base))), 862#(and (<= |cbzero_#in~length| (select |#length| |cbzero_#in~b.base|)) (= 0 |cbzero_#in~b.offset|) (<= 1 |cbzero_#in~length|)), 863#(and (= 0 cbzero_~p~0.offset) (<= cbzero_~length (select |#length| cbzero_~p~0.base)) (<= 1 cbzero_~length))] [2018-02-04 01:45:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:37,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:45:37,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:45:37,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:45:37,496 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 16 states. [2018-02-04 01:45:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:37,766 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-02-04 01:45:37,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:45:37,766 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-02-04 01:45:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:37,766 INFO L225 Difference]: With dead ends: 25 [2018-02-04 01:45:37,766 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:45:37,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:45:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:45:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:45:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:45:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:45:37,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-02-04 01:45:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:37,767 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:45:37,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:45:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:45:37,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:45:37,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:45:37 BoogieIcfgContainer [2018-02-04 01:45:37,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:45:37,771 INFO L168 Benchmark]: Toolchain (without parser) took 2573.22 ms. Allocated memory was 404.2 MB in the beginning and 670.0 MB in the end (delta: 265.8 MB). Free memory was 362.4 MB in the beginning and 634.1 MB in the end (delta: -271.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:37,772 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:37,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.81 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 351.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:37,772 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 404.2 MB. Free memory was 351.8 MB in the beginning and 349.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:37,772 INFO L168 Benchmark]: RCFGBuilder took 138.48 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 335.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:37,772 INFO L168 Benchmark]: TraceAbstraction took 2249.93 ms. Allocated memory was 404.2 MB in the beginning and 670.0 MB in the end (delta: 265.8 MB). Free memory was 333.8 MB in the beginning and 634.1 MB in the end (delta: -300.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:37,773 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 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.81 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 351.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 404.2 MB. Free memory was 351.8 MB in the beginning and 349.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 138.48 ms. Allocated memory is still 404.2 MB. Free memory was 349.2 MB in the beginning and 335.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2249.93 ms. Allocated memory was 404.2 MB in the beginning and 670.0 MB in the end (delta: 265.8 MB). Free memory was 333.8 MB in the beginning and 634.1 MB in the end (delta: -300.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 2.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219 SDtfs, 186 SDslu, 792 SDs, 0 SdLazy, 545 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2/19 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, 10 MinimizatonAttempts, 56 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 17652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 2/19 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/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-45-37-778.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-45-37-778.csv Received shutdown request...