java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:00:38,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:00:38,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:00:38,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:00:38,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:00:38,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:00:38,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:00:38,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:00:38,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:00:38,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:00:38,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:00:38,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:00:38,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:00:38,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:00:38,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:00:38,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:00:38,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:00:38,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:00:38,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:00:38,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:00:38,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:00:38,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:00:38,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:00:38,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:00:38,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:00:38,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:00:38,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:00:38,242 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:00:38,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:00:38,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:00:38,243 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:00:38,243 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:00:38,253 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:00:38,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:00:38,254 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:00:38,255 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:00:38,255 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:00:38,255 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:00:38,255 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:00:38,256 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:00:38,256 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:00:38,256 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:00:38,257 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:00:38,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:00:38,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:00:38,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:00:38,257 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:00:38,257 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:00:38,258 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:00:38,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:00:38,258 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:00:38,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:00:38,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:00:38,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:00:38,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:00:38,259 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:00:38,259 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:00:38,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:00:38,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:00:38,260 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:00:38,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:00:38,260 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:00:38,261 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:00:38,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:00:38,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:00:38,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:00:38,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:00:38,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:00:38,262 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:00:38,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:00:38,310 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:00:38,314 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:00:38,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:00:38,316 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:00:38,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-01-20 22:00:38,503 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:00:38,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:00:38,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:00:38,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:00:38,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:00:38,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c1589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38, skipping insertion in model container [2018-01-20 22:00:38,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,529 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:00:38,566 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:00:38,690 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:00:38,714 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:00:38,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38 WrapperNode [2018-01-20 22:00:38,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:00:38,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:00:38,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:00:38,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:00:38,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... [2018-01-20 22:00:38,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:00:38,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:00:38,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:00:38,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:00:38,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:00:38,822 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:00:38,822 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:00:38,822 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-20 22:00:38,823 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-20 22:00:38,823 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-20 22:00:38,823 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-20 22:00:38,823 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-20 22:00:38,823 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-20 22:00:38,823 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-20 22:00:38,824 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-20 22:00:38,824 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:00:38,824 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:00:38,824 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:00:38,824 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:00:38,824 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:00:38,824 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:00:38,825 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:00:38,825 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:00:38,825 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:00:38,825 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-20 22:00:38,825 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:00:38,825 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-20 22:00:38,826 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-20 22:00:38,826 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-20 22:00:38,826 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-20 22:00:38,826 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-20 22:00:38,826 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-20 22:00:38,827 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-20 22:00:38,827 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-20 22:00:38,827 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:00:38,827 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:00:38,827 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:00:39,177 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:00:39,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:00:39 BoogieIcfgContainer [2018-01-20 22:00:39,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:00:39,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:00:39,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:00:39,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:00:39,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:00:38" (1/3) ... [2018-01-20 22:00:39,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f72a620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:00:39, skipping insertion in model container [2018-01-20 22:00:39,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:00:38" (2/3) ... [2018-01-20 22:00:39,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f72a620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:00:39, skipping insertion in model container [2018-01-20 22:00:39,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:00:39" (3/3) ... [2018-01-20 22:00:39,183 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-01-20 22:00:39,190 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:00:39,196 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-20 22:00:39,233 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:39,233 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:39,233 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:39,233 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:39,233 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:39,233 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:39,233 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:39,234 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __list_addErr0EnsuresViolation======== [2018-01-20 22:00:39,234 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 22:00:39,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:39,261 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:39,261 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr0EnsuresViolation]=== [2018-01-20 22:00:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1421895685, now seen corresponding path program 1 times [2018-01-20 22:00:39,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:39,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:39,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:39,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:39,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:39,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:39,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-01-20 22:00:39,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:39,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:39,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:39,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:39,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:39,456 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:39,577 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:39,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-20 22:00:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:39,586 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:39,586 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:39,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:39,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-20 22:00:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:39,615 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:39,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:39,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:39,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 22:00:39,725 INFO L401 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-20 22:00:39,725 INFO L401 ceAbstractionStarter]: For program point __list_addErr0EnsuresViolation(lines 623 631) no Hoare annotation was computed. [2018-01-20 22:00:39,726 INFO L401 ceAbstractionStarter]: For program point __list_addEXIT(lines 623 631) no Hoare annotation was computed. [2018-01-20 22:00:39,726 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-20 22:00:39,726 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-20 22:00:39,726 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-20 22:00:39,726 INFO L404 ceAbstractionStarter]: At program point __list_addENTRY(lines 623 631) the Hoare annotation is: true [2018-01-20 22:00:39,726 INFO L401 ceAbstractionStarter]: For program point __list_addFINAL(lines 623 631) no Hoare annotation was computed. [2018-01-20 22:00:39,727 INFO L404 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: true [2018-01-20 22:00:39,727 INFO L401 ceAbstractionStarter]: For program point insert_subFINAL(lines 665 672) no Hoare annotation was computed. [2018-01-20 22:00:39,727 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-20 22:00:39,727 INFO L401 ceAbstractionStarter]: For program point insert_subErr0EnsuresViolation(lines 665 672) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L401 ceAbstractionStarter]: For program point L668''(lines 668 669) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L401 ceAbstractionStarter]: For program point L668(lines 668 669) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L401 ceAbstractionStarter]: For program point insert_subEXIT(lines 665 672) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L401 ceAbstractionStarter]: For program point L667'(line 667) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L404 ceAbstractionStarter]: At program point insert_subENTRY(lines 665 672) the Hoare annotation is: true [2018-01-20 22:00:39,728 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-20 22:00:39,728 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 702) the Hoare annotation is: true [2018-01-20 22:00:39,729 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-20 22:00:39,729 INFO L401 ceAbstractionStarter]: For program point L692(lines 692 694) no Hoare annotation was computed. [2018-01-20 22:00:39,729 INFO L404 ceAbstractionStarter]: At program point L692''(lines 692 694) the Hoare annotation is: true [2018-01-20 22:00:39,729 INFO L401 ceAbstractionStarter]: For program point create_topErr0EnsuresViolation(lines 690 695) no Hoare annotation was computed. [2018-01-20 22:00:39,729 INFO L404 ceAbstractionStarter]: At program point L693(line 693) the Hoare annotation is: true [2018-01-20 22:00:39,729 INFO L404 ceAbstractionStarter]: At program point create_topENTRY(lines 690 695) the Hoare annotation is: true [2018-01-20 22:00:39,729 INFO L401 ceAbstractionStarter]: For program point create_topEXIT(lines 690 695) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L401 ceAbstractionStarter]: For program point L693'(line 693) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L401 ceAbstractionStarter]: For program point L692'''(lines 692 694) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L401 ceAbstractionStarter]: For program point insert_topErr0EnsuresViolation(lines 681 689) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L401 ceAbstractionStarter]: For program point L684(lines 684 685) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L404 ceAbstractionStarter]: At program point L684''(lines 684 685) the Hoare annotation is: true [2018-01-20 22:00:39,730 INFO L401 ceAbstractionStarter]: For program point L683(line 683) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L401 ceAbstractionStarter]: For program point L683'(line 683) no Hoare annotation was computed. [2018-01-20 22:00:39,730 INFO L404 ceAbstractionStarter]: At program point L687(line 687) the Hoare annotation is: true [2018-01-20 22:00:39,731 INFO L404 ceAbstractionStarter]: At program point L686(line 686) the Hoare annotation is: true [2018-01-20 22:00:39,731 INFO L404 ceAbstractionStarter]: At program point insert_topENTRY(lines 681 689) the Hoare annotation is: true [2018-01-20 22:00:39,731 INFO L401 ceAbstractionStarter]: For program point insert_topEXIT(lines 681 689) no Hoare annotation was computed. [2018-01-20 22:00:39,731 INFO L401 ceAbstractionStarter]: For program point insert_topFINAL(lines 681 689) no Hoare annotation was computed. [2018-01-20 22:00:39,731 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-20 22:00:39,731 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-20 22:00:39,731 INFO L401 ceAbstractionStarter]: For program point destroy_subErr0EnsuresViolation(lines 645 653) no Hoare annotation was computed. [2018-01-20 22:00:39,731 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-20 22:00:39,732 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 652) no Hoare annotation was computed. [2018-01-20 22:00:39,732 INFO L404 ceAbstractionStarter]: At program point destroy_subENTRY(lines 645 653) the Hoare annotation is: true [2018-01-20 22:00:39,732 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-20 22:00:39,732 INFO L404 ceAbstractionStarter]: At program point L648''(lines 648 652) the Hoare annotation is: true [2018-01-20 22:00:39,732 INFO L401 ceAbstractionStarter]: For program point L648'''(lines 648 652) no Hoare annotation was computed. [2018-01-20 22:00:39,732 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-20 22:00:39,732 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-20 22:00:39,732 INFO L401 ceAbstractionStarter]: For program point destroy_subEXIT(lines 645 653) no Hoare annotation was computed. [2018-01-20 22:00:39,733 INFO L401 ceAbstractionStarter]: For program point L677'''(lines 677 679) no Hoare annotation was computed. [2018-01-20 22:00:39,733 INFO L404 ceAbstractionStarter]: At program point L678(line 678) the Hoare annotation is: true [2018-01-20 22:00:39,733 INFO L401 ceAbstractionStarter]: For program point L677(lines 677 679) no Hoare annotation was computed. [2018-01-20 22:00:39,733 INFO L404 ceAbstractionStarter]: At program point L677''(lines 677 679) the Hoare annotation is: true [2018-01-20 22:00:39,733 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-20 22:00:39,733 INFO L401 ceAbstractionStarter]: For program point create_sub_listEXIT(lines 673 680) no Hoare annotation was computed. [2018-01-20 22:00:39,733 INFO L404 ceAbstractionStarter]: At program point create_sub_listENTRY(lines 673 680) the Hoare annotation is: true [2018-01-20 22:00:39,734 INFO L401 ceAbstractionStarter]: For program point create_sub_listErr0EnsuresViolation(lines 673 680) no Hoare annotation was computed. [2018-01-20 22:00:39,734 INFO L401 ceAbstractionStarter]: For program point L678'(line 678) no Hoare annotation was computed. [2018-01-20 22:00:39,734 INFO L401 ceAbstractionStarter]: For program point L675'(line 675) no Hoare annotation was computed. [2018-01-20 22:00:39,734 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 702) the Hoare annotation is: true [2018-01-20 22:00:39,734 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-20 22:00:39,734 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 702) the Hoare annotation is: true [2018-01-20 22:00:39,734 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-20 22:00:39,735 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-20 22:00:39,735 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 696 702) the Hoare annotation is: true [2018-01-20 22:00:39,735 INFO L401 ceAbstractionStarter]: For program point L698'''(line 698) no Hoare annotation was computed. [2018-01-20 22:00:39,735 INFO L401 ceAbstractionStarter]: For program point L698'(line 698) no Hoare annotation was computed. [2018-01-20 22:00:39,735 INFO L401 ceAbstractionStarter]: For program point L700(line 700) no Hoare annotation was computed. [2018-01-20 22:00:39,735 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 696 702) no Hoare annotation was computed. [2018-01-20 22:00:39,735 INFO L404 ceAbstractionStarter]: At program point L699(line 699) the Hoare annotation is: true [2018-01-20 22:00:39,735 INFO L401 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-01-20 22:00:39,736 INFO L401 ceAbstractionStarter]: For program point L698''''(line 698) no Hoare annotation was computed. [2018-01-20 22:00:39,736 INFO L404 ceAbstractionStarter]: At program point L698''(line 698) the Hoare annotation is: true [2018-01-20 22:00:39,736 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 696 702) no Hoare annotation was computed. [2018-01-20 22:00:39,736 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 696 702) no Hoare annotation was computed. [2018-01-20 22:00:39,736 INFO L401 ceAbstractionStarter]: For program point list_add_tailEXIT(lines 632 635) no Hoare annotation was computed. [2018-01-20 22:00:39,736 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-20 22:00:39,736 INFO L401 ceAbstractionStarter]: For program point list_add_tailFINAL(lines 632 635) no Hoare annotation was computed. [2018-01-20 22:00:39,736 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L401 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L404 ceAbstractionStarter]: At program point list_add_tailENTRY(lines 632 635) the Hoare annotation is: true [2018-01-20 22:00:39,737 INFO L401 ceAbstractionStarter]: For program point list_add_tailErr0EnsuresViolation(lines 632 635) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L401 ceAbstractionStarter]: For program point destroy_topErr0EnsuresViolation(lines 654 664) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L401 ceAbstractionStarter]: For program point L661(line 661) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-20 22:00:39,737 INFO L404 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: true [2018-01-20 22:00:39,738 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-20 22:00:39,738 INFO L404 ceAbstractionStarter]: At program point L657''(lines 657 663) the Hoare annotation is: true [2018-01-20 22:00:39,738 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 663) no Hoare annotation was computed. [2018-01-20 22:00:39,738 INFO L404 ceAbstractionStarter]: At program point L659'(line 659) the Hoare annotation is: true [2018-01-20 22:00:39,738 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-20 22:00:39,738 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-20 22:00:39,738 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 663) no Hoare annotation was computed. [2018-01-20 22:00:39,738 INFO L404 ceAbstractionStarter]: At program point destroy_topENTRY(lines 654 664) the Hoare annotation is: true [2018-01-20 22:00:39,738 INFO L401 ceAbstractionStarter]: For program point destroy_topEXIT(lines 654 664) no Hoare annotation was computed. [2018-01-20 22:00:39,742 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:39,743 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:39,743 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:39,743 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:39,743 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:39,743 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:39,743 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:39,743 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_subErr0EnsuresViolation======== [2018-01-20 22:00:39,743 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 22:00:39,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:39,749 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:39,749 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_subErr0EnsuresViolation]=== [2018-01-20 22:00:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash 712574584, now seen corresponding path program 1 times [2018-01-20 22:00:39,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:39,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:39,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:39,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:39,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:39,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:39,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:39,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:39,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:39,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:39,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:39,810 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:39,824 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:39,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-01-20 22:00:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:39,829 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:39,829 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 22:00:39,830 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 22:00:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 22:00:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 22:00:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-20 22:00:39,843 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2018-01-20 22:00:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:39,844 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-20 22:00:39,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-20 22:00:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 22:00:39,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:39,846 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:39,846 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_subErr0EnsuresViolation]=== [2018-01-20 22:00:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1047454716, now seen corresponding path program 1 times [2018-01-20 22:00:39,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:39,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:39,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:39,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:39,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:00:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:00:39,990 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:00:40,004 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:00:40,010 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:00:40,011 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:00:40,012 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:00:40,024 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:40,024 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:40,024 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:40,024 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:40,024 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:40,024 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:40,024 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:40,024 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:00:40,024 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:00:40,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:40,027 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:00:40,027 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:00:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 189700, now seen corresponding path program 1 times [2018-01-20 22:00:40,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:40,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:40,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:00:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:00:40,036 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:00:40,037 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:00:40,039 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:40,039 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:40,039 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:40,039 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:40,040 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:40,040 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:40,040 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:40,040 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_topErr0EnsuresViolation======== [2018-01-20 22:00:40,040 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-20 22:00:40,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:40,043 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:40,043 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_topErr0EnsuresViolation]=== [2018-01-20 22:00:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1605295434, now seen corresponding path program 1 times [2018-01-20 22:00:40,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:40,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:40,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:40,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:40,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:40,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:40,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:40,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:40,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:40,063 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:40,074 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:40,075 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-20 22:00:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:40,076 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:40,076 INFO L226 Difference]: Without dead ends: 55 [2018-01-20 22:00:40,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-20 22:00:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-20 22:00:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 22:00:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-20 22:00:40,085 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 12 [2018-01-20 22:00:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:40,085 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-20 22:00:40,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-20 22:00:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-20 22:00:40,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:40,089 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:40,089 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_topErr0EnsuresViolation]=== [2018-01-20 22:00:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash -817398474, now seen corresponding path program 1 times [2018-01-20 22:00:40,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:40,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:40,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:40,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-20 22:00:40,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:00:40,221 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:00:40,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:40,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:00:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-20 22:00:40,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:00:40,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-20 22:00:40,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:00:40,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:00:40,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:00:40,399 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-20 22:00:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:40,484 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-01-20 22:00:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:00:40,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-01-20 22:00:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:40,485 INFO L225 Difference]: With dead ends: 87 [2018-01-20 22:00:40,485 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:40,486 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:00:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:40,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-01-20 22:00:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:40,487 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:40,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:00:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:40,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:40,488 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:40,488 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:40,488 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:40,489 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:40,489 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:40,489 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:40,489 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:40,489 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_topErr0EnsuresViolation======== [2018-01-20 22:00:40,489 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 22:00:40,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:40,491 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:40,492 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_topErr0EnsuresViolation]=== [2018-01-20 22:00:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1794587042, now seen corresponding path program 1 times [2018-01-20 22:00:40,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:40,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:40,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:40,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:00:40,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:40,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:40,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:40,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:40,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:40,527 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:40,537 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:40,537 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2018-01-20 22:00:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:40,538 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:40,538 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 22:00:40,539 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 22:00:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 22:00:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 22:00:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-20 22:00:40,546 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 45 [2018-01-20 22:00:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:40,547 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-20 22:00:40,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-20 22:00:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-20 22:00:40,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:40,549 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-20 22:00:40,549 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_topErr0EnsuresViolation]=== [2018-01-20 22:00:40,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1017096708, now seen corresponding path program 1 times [2018-01-20 22:00:40,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:40,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:40,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:40,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-20 22:00:40,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:00:40,650 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:00:40,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:40,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:00:40,767 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-20 22:00:40,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:00:40,792 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-20 22:00:40,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:00:40,795 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-01-20 22:00:40,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-20 22:00:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 22:00:40,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:00:40,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-20 22:00:40,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:00:40,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:00:40,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-20 22:00:40,898 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-01-20 22:00:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:41,042 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-20 22:00:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:00:41,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-01-20 22:00:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:41,043 INFO L225 Difference]: With dead ends: 86 [2018-01-20 22:00:41,043 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:41,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2018-01-20 22:00:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:41,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-01-20 22:00:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:41,045 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:41,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:00:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:41,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:41,046 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:41,046 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:41,046 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:41,047 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:41,047 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:41,047 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:41,047 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:41,047 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_subErr0EnsuresViolation======== [2018-01-20 22:00:41,047 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 22:00:41,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:41,049 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:41,049 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_subErr0EnsuresViolation]=== [2018-01-20 22:00:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash 781950497, now seen corresponding path program 1 times [2018-01-20 22:00:41,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:41,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:41,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:41,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:41,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:41,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:41,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:41,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:41,066 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:41,074 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:41,074 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-20 22:00:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:41,075 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:41,076 INFO L226 Difference]: Without dead ends: 79 [2018-01-20 22:00:41,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-20 22:00:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-20 22:00:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-20 22:00:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-20 22:00:41,085 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-01-20 22:00:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:41,085 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-20 22:00:41,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-20 22:00:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-20 22:00:41,087 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:41,087 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:41,087 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_subErr0EnsuresViolation]=== [2018-01-20 22:00:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash 885609031, now seen corresponding path program 1 times [2018-01-20 22:00:41,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:41,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:41,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-20 22:00:41,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:00:41,169 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:00:41,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:00:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-20 22:00:41,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:00:41,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-20 22:00:41,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:00:41,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:00:41,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:00:41,306 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 4 states. [2018-01-20 22:00:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:41,425 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-01-20 22:00:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:00:41,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-01-20 22:00:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:41,426 INFO L225 Difference]: With dead ends: 111 [2018-01-20 22:00:41,426 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:41,427 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:00:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:41,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-01-20 22:00:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:41,428 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:41,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:00:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:41,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:41,429 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:41,430 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:41,430 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:41,430 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:41,430 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:41,430 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:41,430 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:41,430 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_sub_listErr0EnsuresViolation======== [2018-01-20 22:00:41,430 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 22:00:41,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:41,432 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:41,433 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_sub_listErr0EnsuresViolation]=== [2018-01-20 22:00:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1195581130, now seen corresponding path program 1 times [2018-01-20 22:00:41,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:41,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:41,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:41,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:41,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:41,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:41,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:41,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:41,450 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:41,457 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:41,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:41,457 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-20 22:00:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:41,458 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:41,458 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 22:00:41,459 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 22:00:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 22:00:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 22:00:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-20 22:00:41,464 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 22 [2018-01-20 22:00:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:41,464 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-20 22:00:41,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-20 22:00:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:00:41,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:41,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:41,465 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_sub_listErr0EnsuresViolation]=== [2018-01-20 22:00:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash -463951323, now seen corresponding path program 1 times [2018-01-20 22:00:41,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:41,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:41,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:41,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:41,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:41,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:00:41,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:00:41,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:00:41,518 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 3 states. [2018-01-20 22:00:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:41,566 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-20 22:00:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:00:41,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-20 22:00:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:41,567 INFO L225 Difference]: With dead ends: 54 [2018-01-20 22:00:41,567 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:41,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:00:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:41,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-20 22:00:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:41,569 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:41,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:00:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:41,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:41,570 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:41,570 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:41,570 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:41,570 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:41,570 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:41,571 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:41,571 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:41,571 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:00:41,571 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 22:00:41,573 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:41,573 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:41,573 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:00:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1280962335, now seen corresponding path program 1 times [2018-01-20 22:00:41,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:41,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:41,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:41,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:41,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:41,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:41,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:41,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:41,587 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:41,593 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:41,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-20 22:00:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:41,595 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:41,595 INFO L226 Difference]: Without dead ends: 87 [2018-01-20 22:00:41,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-20 22:00:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-20 22:00:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-20 22:00:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-20 22:00:41,603 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-01-20 22:00:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:41,604 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-20 22:00:41,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-20 22:00:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-20 22:00:41,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:41,605 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:41,605 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:00:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash 167217557, now seen corresponding path program 1 times [2018-01-20 22:00:41,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:41,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:41,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-20 22:00:41,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:00:41,687 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:00:41,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:41,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:00:41,791 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-20 22:00:41,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:00:41,808 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-20 22:00:41,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:00:41,811 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-01-20 22:00:41,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-20 22:00:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 22:00:41,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:00:41,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-20 22:00:41,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:00:41,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:00:41,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-20 22:00:41,904 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 7 states. [2018-01-20 22:00:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:42,021 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-01-20 22:00:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:00:42,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-01-20 22:00:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:42,022 INFO L225 Difference]: With dead ends: 119 [2018-01-20 22:00:42,022 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:42,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2018-01-20 22:00:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:42,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-01-20 22:00:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:42,024 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:42,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:00:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:42,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:42,025 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:42,026 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:42,026 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:42,026 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:42,026 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:42,026 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:42,026 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:42,026 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:00:42,026 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:00:42,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:42,028 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:42,028 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:00:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash 870174460, now seen corresponding path program 1 times [2018-01-20 22:00:42,029 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:42,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:42,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:42,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:42,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:42,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:42,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:42,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:42,042 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:42,048 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:42,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:42,048 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-20 22:00:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:42,049 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:42,049 INFO L226 Difference]: Without dead ends: 85 [2018-01-20 22:00:42,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-20 22:00:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-20 22:00:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-20 22:00:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-20 22:00:42,057 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 24 [2018-01-20 22:00:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:42,057 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-20 22:00:42,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-20 22:00:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-20 22:00:42,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:42,059 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:42,059 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:00:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash 165536944, now seen corresponding path program 1 times [2018-01-20 22:00:42,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:42,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:42,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-20 22:00:42,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:00:42,144 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:00:42,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:00:42,275 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-20 22:00:42,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:00:42,286 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-20 22:00:42,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:00:42,288 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-01-20 22:00:42,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-20 22:00:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-20 22:00:42,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:00:42,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-20 22:00:42,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:00:42,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:00:42,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-20 22:00:42,376 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-20 22:00:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:42,529 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-20 22:00:42,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:00:42,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-01-20 22:00:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:42,530 INFO L225 Difference]: With dead ends: 117 [2018-01-20 22:00:42,530 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:42,531 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2018-01-20 22:00:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:42,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-01-20 22:00:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:42,532 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:42,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:00:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:42,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:42,534 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:42,534 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:42,534 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:42,534 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:42,534 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:42,534 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:42,534 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:42,534 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == list_add_tailErr0EnsuresViolation======== [2018-01-20 22:00:42,534 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-20 22:00:42,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:42,537 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:42,537 INFO L371 AbstractCegarLoop]: === Iteration 1 === [list_add_tailErr0EnsuresViolation]=== [2018-01-20 22:00:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash -176168903, now seen corresponding path program 1 times [2018-01-20 22:00:42,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:42,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:42,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-20 22:00:42,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:42,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:42,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:42,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:42,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:42,562 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:42,568 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:42,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-01-20 22:00:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:42,569 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:42,569 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:42,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:42,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-20 22:00:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:42,571 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:42,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:42,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:42,572 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:00:42,573 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:00:42,573 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:00:42,573 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:00:42,573 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:00:42,573 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:00:42,573 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:00:42,573 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_topErr0EnsuresViolation======== [2018-01-20 22:00:42,573 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:00:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-20 22:00:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:00:42,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:42,575 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:42,575 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_topErr0EnsuresViolation]=== [2018-01-20 22:00:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 391106876, now seen corresponding path program 1 times [2018-01-20 22:00:42,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:42,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:42,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:00:42,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:00:42,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:00:42,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:00:42,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:00:42,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:42,587 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-20 22:00:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:42,594 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-20 22:00:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:00:42,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-20 22:00:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:42,595 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:00:42,595 INFO L226 Difference]: Without dead ends: 80 [2018-01-20 22:00:42,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:00:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-20 22:00:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-20 22:00:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-20 22:00:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-20 22:00:42,602 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 19 [2018-01-20 22:00:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:42,603 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-20 22:00:42,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:00:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-20 22:00:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-20 22:00:42,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:00:42,604 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:00:42,604 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_topErr0EnsuresViolation]=== [2018-01-20 22:00:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash -589432056, now seen corresponding path program 1 times [2018-01-20 22:00:42,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:00:42,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:00:42,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:00:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:00:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-20 22:00:42,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:00:42,719 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:00:42,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:00:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:00:42,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:00:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-20 22:00:42,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:00:42,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-20 22:00:42,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:00:42,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:00:42,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:00:42,857 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 4 states. [2018-01-20 22:00:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:00:42,936 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-20 22:00:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:00:42,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-01-20 22:00:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:00:42,937 INFO L225 Difference]: With dead ends: 112 [2018-01-20 22:00:42,937 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:00:42,938 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:00:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:00:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:00:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:00:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:00:42,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-01-20 22:00:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:00:42,939 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:00:42,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:00:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:00:42,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:00:42,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:00:42 BoogieIcfgContainer [2018-01-20 22:00:42,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:00:42,943 INFO L168 Benchmark]: Toolchain (without parser) took 4439.79 ms. Allocated memory was 300.4 MB in the beginning and 514.3 MB in the end (delta: 213.9 MB). Free memory was 258.7 MB in the beginning and 348.4 MB in the end (delta: -89.7 MB). Peak memory consumption was 124.2 MB. Max. memory is 5.3 GB. [2018-01-20 22:00:42,945 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:00:42,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.65 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 246.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:00:42,945 INFO L168 Benchmark]: Boogie Preprocessor took 44.78 ms. Allocated memory is still 300.4 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:00:42,946 INFO L168 Benchmark]: RCFGBuilder took 406.60 ms. Allocated memory is still 300.4 MB. Free memory was 244.8 MB in the beginning and 217.0 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-01-20 22:00:42,946 INFO L168 Benchmark]: TraceAbstraction took 3763.94 ms. Allocated memory was 300.4 MB in the beginning and 514.3 MB in the end (delta: 213.9 MB). Free memory was 217.0 MB in the beginning and 348.4 MB in the end (delta: -131.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:00:42,948 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.65 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 246.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.78 ms. Allocated memory is still 300.4 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 406.60 ms. Allocated memory is still 300.4 MB. Free memory was 244.8 MB in the beginning and 217.0 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3763.94 ms. Allocated memory was 300.4 MB in the beginning and 514.3 MB in the end (delta: 213.9 MB). Free memory was 217.0 MB in the beginning and 348.4 MB in the end (delta: -131.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 623]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: __list_addErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 59 PreInvPairs, 73 NumberOfFragments, 27 HoareAnnotationTreeSize, 59 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 665]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L698] FCALL struct list_head top = { &(top), &(top) }; VAL [top={33:0}] [L699] CALL create_top(&top) VAL [top={33:0}] [L693] CALL insert_top(top) VAL [head={33:0}] [L683] EXPR, FCALL malloc(sizeof(*top)) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}] [L683] struct top_list *top = malloc(sizeof(*top)); VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L684] COND FALSE !(!top) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L686] CALL create_sub_list(&top->sub1) VAL [sub={38:8}] [L675] FCALL sub->prev = sub VAL [sub={38:8}, sub={38:8}] [L676] FCALL sub->next = sub VAL [sub={38:8}, sub={38:8}] [L678] CALL insert_sub(sub) VAL [head={38:8}] [L667] EXPR, FCALL malloc(sizeof(*sub)) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}] [L667] struct sub_list *sub = malloc(sizeof(*sub)); VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L668] COND FALSE !(!sub) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L670] FCALL sub->number = 0 VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L671] CALL list_add_tail(&sub->link, head) VAL [head={38:8}, new={35:4}] [L634] EXPR, FCALL head->prev VAL [head={38:8}, head={38:8}, head->prev={38:8}, new={35:4}, new={35:4}] [L634] CALL __list_add(new, head->prev, head) VAL [new={35:4}, next={38:8}, prev={38:8}] [L627] FCALL next->prev = new VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L628] FCALL new->next = next VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L629] FCALL new->prev = prev VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L630] RET, FCALL prev->next = new VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L634] RET __list_add(new, head->prev, head) VAL [head={38:8}, head={38:8}, head->prev={38:8}, new={35:4}, new={35:4}] [L671] list_add_tail(&sub->link, head) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: insert_subErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 690]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: create_topErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 19 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 21721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 681]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: insert_topErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 43 SDslu, 17 SDs, 0 SdLazy, 37 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 228 ConstructedInterpolants, 18 QuantifiedInterpolants, 32480 SizeOfPredicates, 3 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 106/118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 645]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: destroy_subErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 21 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 29236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 673]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: create_sub_listErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 18 SDslu, 7 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 3276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 32 SDslu, 23 SDs, 0 SdLazy, 47 SolverSat, 17 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 247 ConstructedInterpolants, 18 QuantifiedInterpolants, 41695 SizeOfPredicates, 3 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 696]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 39 SDslu, 25 SDs, 0 SdLazy, 52 SolverSat, 20 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 241 ConstructedInterpolants, 18 QuantifiedInterpolants, 40423 SizeOfPredicates, 3 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 632]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: list_add_tailErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 654]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: destroy_topErr0EnsuresViolation CFG has 11 procedures, 98 locations, 11 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 21 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 25180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 657]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-20_22-00-42-961.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-20_22-00-42-961.csv Received shutdown request...