java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:37:58,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:37:58,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:37:58,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:37:58,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:37:58,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:37:58,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:37:58,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:37:58,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:37:58,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:37:58,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:37:58,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:37:58,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:37:58,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:37:58,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:37:58,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:37:58,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:37:58,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:37:58,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:37:58,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:37:58,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:37:58,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:37:58,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:37:58,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:37:58,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:37:58,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:37:58,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:37:58,909 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:37:58,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:37:58,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:37:58,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:37:58,910 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:37:58,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:37:58,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:37:58,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:37:58,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:37:58,921 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:37:58,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:37:58,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:37:58,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:37:58,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:37:58,922 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:37:58,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:37:58,923 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:37:58,923 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:37:58,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:37:58,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:37:58,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:37:58,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:37:58,924 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:37:58,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:37:58,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:37:58,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:37:58,924 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:37:58,924 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:37:58,925 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:37:58,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:37:58,966 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:37:58,971 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:37:58,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:37:58,973 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:37:58,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:59,123 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:37:59,124 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:37:59,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:59,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:37:59,132 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:37:59,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59, skipping insertion in model container [2018-02-04 17:37:59,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,150 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:59,181 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:59,272 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:59,284 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:59,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59 WrapperNode [2018-02-04 17:37:59,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:59,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:37:59,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:37:59,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:37:59,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (1/1) ... [2018-02-04 17:37:59,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:37:59,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:37:59,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:37:59,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:37:59,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (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 17:37:59,349 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:37:59,350 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:37:59,350 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-02-04 17:37:59,350 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:37:59,350 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:37:59,350 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:37:59,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:37:59,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:37:59,350 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:37:59,351 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:37:59,351 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-02-04 17:37:59,351 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:37:59,351 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:37:59,351 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:37:59,465 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:37:59,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:59 BoogieIcfgContainer [2018-02-04 17:37:59,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:37:59,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:37:59,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:37:59,468 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:37:59,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:37:59" (1/3) ... [2018-02-04 17:37:59,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fbee25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:59, skipping insertion in model container [2018-02-04 17:37:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:59" (2/3) ... [2018-02-04 17:37:59,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fbee25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:59, skipping insertion in model container [2018-02-04 17:37:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:59" (3/3) ... [2018-02-04 17:37:59,471 INFO L107 eAbstractionObserver]: Analyzing ICFG stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:59,476 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:37:59,480 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 17:37:59,512 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:37:59,512 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:37:59,513 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:37:59,513 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:37:59,513 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:37:59,513 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:37:59,513 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:37:59,513 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:37:59,514 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:37:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 17:37:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:37:59,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:59,536 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:59,536 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -443509723, now seen corresponding path program 1 times [2018-02-04 17:37:59,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:59,543 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:59,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:59,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:59,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:59,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:59,747 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 17:37:59,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:59,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:37:59,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:37:59,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:37:59,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:37:59,761 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-02-04 17:37:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:59,870 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-04 17:37:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:37:59,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 17:37:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:59,924 INFO L225 Difference]: With dead ends: 33 [2018-02-04 17:37:59,924 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 17:37:59,925 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 17:37:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 17:37:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-02-04 17:37:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 17:37:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 17:37:59,946 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-04 17:37:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:59,947 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 17:37:59,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:37:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 17:37:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:37:59,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:59,947 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:59,947 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:37:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -443509722, now seen corresponding path program 1 times [2018-02-04 17:37:59,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:59,948 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:59,948 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:59,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:59,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:59,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:00,060 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 17:38:00,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:00,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:38:00,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:38:00,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:38:00,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:38:00,063 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-02-04 17:38:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:00,202 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 17:38:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:38:00,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 17:38:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:00,203 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:38:00,204 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:38:00,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:38:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:38:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-02-04 17:38:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 17:38:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-02-04 17:38:00,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2018-02-04 17:38:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:00,208 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-02-04 17:38:00,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:38:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-02-04 17:38:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:38:00,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:00,209 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:00,209 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:38:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash -537553629, now seen corresponding path program 1 times [2018-02-04 17:38:00,210 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:00,210 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:00,211 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:00,211 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:00,211 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:00,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:00,313 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 17:38:00,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:00,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:00,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:00,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:00,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:00,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2018-02-04 17:38:00,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:38:00,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:38:00,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:38:00,385 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 13 states. [2018-02-04 17:38:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:00,507 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 17:38:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:38:00,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-02-04 17:38:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:00,508 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:38:00,508 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:38:00,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:38:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:38:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-04 17:38:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:38:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 17:38:00,511 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 19 [2018-02-04 17:38:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:00,512 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 17:38:00,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:38:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 17:38:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:38:00,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:00,512 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:00,512 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:38:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359643, now seen corresponding path program 1 times [2018-02-04 17:38:00,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:00,513 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:00,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:00,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:00,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:00,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:00,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:00,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:00,654 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:00,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:00,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:38:00,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:00,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:00,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:38:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:00,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:00,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-02-04 17:38:00,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:38:00,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:38:00,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:38:00,870 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 18 states. [2018-02-04 17:38:01,160 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 47 DAG size of output 39 [2018-02-04 17:38:01,806 WARN L146 SmtUtils]: Spent 615ms on a formula simplification. DAG size of input: 58 DAG size of output 46 [2018-02-04 17:38:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:01,853 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 17:38:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:38:01,853 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-02-04 17:38:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:01,854 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:38:01,855 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 17:38:01,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:38:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 17:38:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-02-04 17:38:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:38:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-04 17:38:01,860 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-02-04 17:38:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:01,860 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-04 17:38:01,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:38:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-04 17:38:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:38:01,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:01,861 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] [2018-02-04 17:38:01,861 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:38:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 950757514, now seen corresponding path program 1 times [2018-02-04 17:38:01,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:01,861 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:01,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:01,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:01,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:01,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:01,895 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 17:38:01,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:01,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:38:01,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:01,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:01,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:01,896 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-02-04 17:38:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:01,924 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 17:38:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:38:01,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 17:38:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:01,925 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:38:01,925 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:38:01,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:38:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:38:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-02-04 17:38:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:38:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-04 17:38:01,929 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 20 [2018-02-04 17:38:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:01,932 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-04 17:38:01,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-04 17:38:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:38:01,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:01,933 INFO L351 BasicCegarLoop]: trace histogram [2, 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 17:38:01,933 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:38:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1524168647, now seen corresponding path program 1 times [2018-02-04 17:38:01,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:01,933 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:01,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:01,934 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:01,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:01,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:01,957 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:01,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:01,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:01,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:01,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:01,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:01,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 17:38:01,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:01,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:01,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:38:02,028 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc3.base| 0)))) is different from true [2018-02-04 17:38:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:38:02,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:02,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:38:02,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:38:02,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:38:02,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:38:02,032 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2018-02-04 17:38:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:02,169 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-02-04 17:38:02,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:38:02,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 17:38:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:02,169 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:38:02,169 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:38:02,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:38:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:38:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:38:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:38:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:38:02,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 17:38:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:02,170 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:38:02,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:38:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:38:02,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:38:02,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:38:02 BoogieIcfgContainer [2018-02-04 17:38:02,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:38:02,178 INFO L168 Benchmark]: Toolchain (without parser) took 3053.79 ms. Allocated memory was 402.7 MB in the beginning and 625.5 MB in the end (delta: 222.8 MB). Free memory was 358.0 MB in the beginning and 522.7 MB in the end (delta: -164.7 MB). Peak memory consumption was 58.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:02,179 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:38:02,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.63 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 347.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:02,179 INFO L168 Benchmark]: Boogie Preprocessor took 22.68 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 344.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:02,179 INFO L168 Benchmark]: RCFGBuilder took 154.51 ms. Allocated memory is still 402.7 MB. Free memory was 344.8 MB in the beginning and 330.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:02,179 INFO L168 Benchmark]: TraceAbstraction took 2710.85 ms. Allocated memory was 402.7 MB in the beginning and 625.5 MB in the end (delta: 222.8 MB). Free memory was 328.9 MB in the beginning and 522.7 MB in the end (delta: -193.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:02,183 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.17 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.63 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 347.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.68 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 344.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 154.51 ms. Allocated memory is still 402.7 MB. Free memory was 344.8 MB in the beginning and 330.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2710.85 ms. Allocated memory was 402.7 MB in the beginning and 625.5 MB in the end (delta: 222.8 MB). Free memory was 328.9 MB in the beginning and 522.7 MB in the end (delta: -193.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: 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.6s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 218 SDslu, 508 SDs, 0 SdLazy, 377 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, 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, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 141 ConstructedInterpolants, 22 QuantifiedInterpolants, 16743 SizeOfPredicates, 14 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 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/stroeder1-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-38-02-189.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-38-02-189.csv Received shutdown request...