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_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:25:22,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:25:22,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:25:22,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:25:22,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:25:22,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:25:22,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:25:22,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:25:22,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:25:22,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:25:22,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:25:22,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:25:22,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:25:22,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:25:22,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:25:22,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:25:22,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:25:22,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:25:22,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:25:22,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:25:22,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:25:22,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:25:22,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:25:22,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:25:22,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:25:22,900 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:25:22,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:25:22,901 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:25:22,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:25:22,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:25:22,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:25:22,902 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-23 14:25:22,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:25:22,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:25:22,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:25:22,914 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:25:22,914 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:25:22,914 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:25:22,914 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:25:22,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:25:22,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:25:22,915 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:25:22,916 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:25:22,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:25:22,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:25:22,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:25:22,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:25:22,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:25:22,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:25:22,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:25:22,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:25:22,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:25:22,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:25:22,918 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:25:22,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:25:22,918 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:25:22,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:25:22,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:25:22,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:25:22,919 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:25:22,919 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:25:22,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:25:22,920 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:25:22,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:25:22,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:25:22,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:25:22,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:25:22,921 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:25:22,922 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:25:22,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:25:22,969 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:25:22,973 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:25:22,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:25:22,975 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:25:22,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-23 14:25:23,170 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:25:23,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:25:23,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:25:23,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:25:23,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:25:23,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169cf693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23, skipping insertion in model container [2018-01-23 14:25:23,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,206 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:25:23,249 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:25:23,370 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:25:23,389 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:25:23,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23 WrapperNode [2018-01-23 14:25:23,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:25:23,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:25:23,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:25:23,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:25:23,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (1/1) ... [2018-01-23 14:25:23,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:25:23,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:25:23,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:25:23,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:25:23,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (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-23 14:25:23,491 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:25:23,491 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-23 14:25:23,492 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:25:23,492 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:25:23,493 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:25:23,494 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-23 14:25:23,494 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:25:23,494 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-23 14:25:23,494 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-23 14:25:23,494 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-23 14:25:23,495 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-23 14:25:23,495 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-23 14:25:23,495 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-23 14:25:23,495 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-23 14:25:23,495 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-23 14:25:23,495 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:25:23,496 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:25:23,496 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:25:23,841 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:25:23,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:25:23 BoogieIcfgContainer [2018-01-23 14:25:23,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:25:23,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:25:23,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:25:23,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:25:23,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:25:23" (1/3) ... [2018-01-23 14:25:23,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9f0a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:25:23, skipping insertion in model container [2018-01-23 14:25:23,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:23" (2/3) ... [2018-01-23 14:25:23,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9f0a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:25:23, skipping insertion in model container [2018-01-23 14:25:23,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:25:23" (3/3) ... [2018-01-23 14:25:23,848 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-23 14:25:23,855 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:25:23,862 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-23 14:25:23,902 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:23,902 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:23,902 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:23,902 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:23,902 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:23,903 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:23,903 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:23,903 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __list_addErr0EnsuresViolation======== [2018-01-23 14:25:23,903 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:25:23,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:23,930 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-23 14:25:23,931 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr0EnsuresViolation]=== [2018-01-23 14:25:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1080187328, now seen corresponding path program 1 times [2018-01-23 14:25:23,936 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:23,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:23,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:23,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:23,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:24,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:24,149 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-23 14:25:24,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:24,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:24,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:24,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:24,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:24,166 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:24,274 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:24,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-23 14:25:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:24,283 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:24,283 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:24,289 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-23 14:25:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:24,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-23 14:25:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:24,313 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:24,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:24,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:25:24,375 INFO L401 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-23 14:25:24,375 INFO L401 ceAbstractionStarter]: For program point __list_addErr0EnsuresViolation(lines 623 631) no Hoare annotation was computed. [2018-01-23 14:25:24,375 INFO L401 ceAbstractionStarter]: For program point __list_addEXIT(lines 623 631) no Hoare annotation was computed. [2018-01-23 14:25:24,375 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:25:24,375 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-23 14:25:24,375 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-23 14:25:24,375 INFO L404 ceAbstractionStarter]: At program point __list_addENTRY(lines 623 631) the Hoare annotation is: true [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point __list_addFINAL(lines 623 631) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point insert_subFINAL(lines 664 671) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point L667(lines 667 668) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point L667''(lines 667 668) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point insert_subErr0EnsuresViolation(lines 664 671) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L404 ceAbstractionStarter]: At program point L669(line 669) the Hoare annotation is: true [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point insert_subEXIT(lines 664 671) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L404 ceAbstractionStarter]: At program point insert_subENTRY(lines 664 671) the Hoare annotation is: true [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 701) no Hoare annotation was computed. [2018-01-23 14:25:24,376 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 701) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 701) the Hoare annotation is: true [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 701) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L404 ceAbstractionStarter]: At program point L692(line 692) the Hoare annotation is: true [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point L691(lines 691 693) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L404 ceAbstractionStarter]: At program point L691''(lines 691 693) the Hoare annotation is: true [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point create_topErr0EnsuresViolation(lines 689 694) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L404 ceAbstractionStarter]: At program point create_topENTRY(lines 689 694) the Hoare annotation is: true [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point create_topEXIT(lines 689 694) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point L692'(line 692) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point L691'''(lines 691 693) no Hoare annotation was computed. [2018-01-23 14:25:24,377 INFO L401 ceAbstractionStarter]: For program point insert_topErr0EnsuresViolation(lines 680 688) no Hoare annotation was computed. [2018-01-23 14:25:24,378 INFO L404 ceAbstractionStarter]: At program point L685(line 685) the Hoare annotation is: true [2018-01-23 14:25:24,378 INFO L401 ceAbstractionStarter]: For program point L683(lines 683 684) no Hoare annotation was computed. [2018-01-23 14:25:24,378 INFO L404 ceAbstractionStarter]: At program point L683''(lines 683 684) the Hoare annotation is: true [2018-01-23 14:25:24,378 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-23 14:25:24,378 INFO L401 ceAbstractionStarter]: For program point L682'(line 682) no Hoare annotation was computed. [2018-01-23 14:25:24,378 INFO L404 ceAbstractionStarter]: At program point L686(line 686) the Hoare annotation is: true [2018-01-23 14:25:24,378 INFO L404 ceAbstractionStarter]: At program point insert_topENTRY(lines 680 688) the Hoare annotation is: true [2018-01-23 14:25:24,378 INFO L401 ceAbstractionStarter]: For program point insert_topEXIT(lines 680 688) no Hoare annotation was computed. [2018-01-23 14:25:24,378 INFO L401 ceAbstractionStarter]: For program point insert_topFINAL(lines 680 688) no Hoare annotation was computed. [2018-01-23 14:25:24,378 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point destroy_subErr0EnsuresViolation(lines 645 653) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 652) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L404 ceAbstractionStarter]: At program point destroy_subENTRY(lines 645 653) the Hoare annotation is: true [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L404 ceAbstractionStarter]: At program point L648''(lines 648 652) the Hoare annotation is: true [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L648'''(lines 648 652) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-23 14:25:24,379 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-23 14:25:24,380 INFO L401 ceAbstractionStarter]: For program point destroy_subEXIT(lines 645 653) no Hoare annotation was computed. [2018-01-23 14:25:24,380 INFO L401 ceAbstractionStarter]: For program point L676'''(lines 676 678) no Hoare annotation was computed. [2018-01-23 14:25:24,380 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-23 14:25:24,380 INFO L401 ceAbstractionStarter]: For program point L674'(line 674) no Hoare annotation was computed. [2018-01-23 14:25:24,380 INFO L404 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: true [2018-01-23 14:25:24,380 INFO L401 ceAbstractionStarter]: For program point L676(lines 676 678) no Hoare annotation was computed. [2018-01-23 14:25:24,380 INFO L404 ceAbstractionStarter]: At program point L676''(lines 676 678) the Hoare annotation is: true [2018-01-23 14:25:24,381 INFO L401 ceAbstractionStarter]: For program point create_sub_listEXIT(lines 672 679) no Hoare annotation was computed. [2018-01-23 14:25:24,381 INFO L404 ceAbstractionStarter]: At program point create_sub_listENTRY(lines 672 679) the Hoare annotation is: true [2018-01-23 14:25:24,381 INFO L401 ceAbstractionStarter]: For program point create_sub_listErr0EnsuresViolation(lines 672 679) no Hoare annotation was computed. [2018-01-23 14:25:24,381 INFO L401 ceAbstractionStarter]: For program point L677'(line 677) no Hoare annotation was computed. [2018-01-23 14:25:24,381 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 701) the Hoare annotation is: true [2018-01-23 14:25:24,381 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 701) no Hoare annotation was computed. [2018-01-23 14:25:24,381 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 701) the Hoare annotation is: true [2018-01-23 14:25:24,381 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 701) no Hoare annotation was computed. [2018-01-23 14:25:24,381 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 701) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 695 701) the Hoare annotation is: true [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point L697'''(line 697) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point L697'(line 697) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 695 701) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point L699(line 699) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L404 ceAbstractionStarter]: At program point L698(line 698) the Hoare annotation is: true [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point L697(line 697) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L404 ceAbstractionStarter]: At program point L697''(line 697) the Hoare annotation is: true [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point L697''''(line 697) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 695 701) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 695 701) no Hoare annotation was computed. [2018-01-23 14:25:24,382 INFO L401 ceAbstractionStarter]: For program point list_add_tailEXIT(lines 632 635) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point list_add_tailFINAL(lines 632 635) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L404 ceAbstractionStarter]: At program point list_add_tailENTRY(lines 632 635) the Hoare annotation is: true [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point list_add_tailErr0EnsuresViolation(lines 632 635) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point destroy_topErr0EnsuresViolation(lines 654 663) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L404 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: true [2018-01-23 14:25:24,383 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-23 14:25:24,383 INFO L404 ceAbstractionStarter]: At program point L657''(lines 657 662) the Hoare annotation is: true [2018-01-23 14:25:24,384 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 662) no Hoare annotation was computed. [2018-01-23 14:25:24,384 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-23 14:25:24,384 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-23 14:25:24,384 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-23 14:25:24,384 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 662) no Hoare annotation was computed. [2018-01-23 14:25:24,384 INFO L404 ceAbstractionStarter]: At program point destroy_topENTRY(lines 654 663) the Hoare annotation is: true [2018-01-23 14:25:24,384 INFO L401 ceAbstractionStarter]: For program point destroy_topEXIT(lines 654 663) no Hoare annotation was computed. [2018-01-23 14:25:24,387 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:24,387 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:24,387 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:24,388 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:24,388 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:24,388 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:24,388 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:24,388 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_subErr0EnsuresViolation======== [2018-01-23 14:25:24,388 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:25:24,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:24,394 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-23 14:25:24,394 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_subErr0EnsuresViolation]=== [2018-01-23 14:25:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash -630072835, now seen corresponding path program 1 times [2018-01-23 14:25:24,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:24,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:24,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:24,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:24,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:24,467 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-23 14:25:24,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:24,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:24,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:24,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:24,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:24,469 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:24,482 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:24,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-01-23 14:25:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:24,487 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:24,487 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:25:24,488 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-23 14:25:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:25:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:25:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:25:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-23 14:25:24,506 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2018-01-23 14:25:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:24,506 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-23 14:25:24,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-23 14:25:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:25:24,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:24,509 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-23 14:25:24,510 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_subErr0EnsuresViolation]=== [2018-01-23 14:25:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2076546559, now seen corresponding path program 1 times [2018-01-23 14:25:24,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:24,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:24,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:24,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:24,644 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:25:24,655 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:24,661 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:24,662 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:24,662 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:24,674 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:24,674 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:24,674 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:24,674 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:24,674 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:24,674 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:24,674 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:24,674 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:25:24,674 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:25:24,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:24,677 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:25:24,677 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:25:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash 186785, now seen corresponding path program 1 times [2018-01-23 14:25:24,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:24,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:24,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:24,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:24,686 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:25:24,687 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:24,689 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:24,689 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:24,689 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:24,690 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:24,690 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:24,690 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:24,690 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:24,690 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_topErr0EnsuresViolation======== [2018-01-23 14:25:24,690 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-23 14:25:24,693 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:24,693 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:24,693 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_topErr0EnsuresViolation]=== [2018-01-23 14:25:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash 194822873, now seen corresponding path program 1 times [2018-01-23 14:25:24,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:24,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:24,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:24,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:24,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:24,712 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-23 14:25:24,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:24,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:24,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:24,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:24,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:24,713 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:24,726 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:24,726 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-23 14:25:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:24,727 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:24,728 INFO L226 Difference]: Without dead ends: 55 [2018-01-23 14:25:24,729 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-23 14:25:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-23 14:25:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-23 14:25:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-23 14:25:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-23 14:25:24,736 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 12 [2018-01-23 14:25:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:24,737 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-23 14:25:24,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-23 14:25:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-23 14:25:24,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:24,740 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-23 14:25:24,741 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_topErr0EnsuresViolation]=== [2018-01-23 14:25:24,741 INFO L82 PathProgramCache]: Analyzing trace with hash 797717174, now seen corresponding path program 1 times [2018-01-23 14:25:24,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:24,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:24,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:24,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:24,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:24,899 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-23 14:25:24,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:24,899 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-23 14:25:24,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:25,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:25,068 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-23 14:25:25,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:25,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-23 14:25:25,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:25:25,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:25:25,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:25:25,092 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-23 14:25:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:25,250 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-01-23 14:25:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:25:25,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-01-23 14:25:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:25,252 INFO L225 Difference]: With dead ends: 87 [2018-01-23 14:25:25,252 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:25,253 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-23 14:25:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:25,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-01-23 14:25:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:25,254 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:25,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:25:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:25,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:25,257 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:25,257 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:25,257 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:25,257 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:25,257 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:25,258 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:25,258 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:25,258 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_topErr0EnsuresViolation======== [2018-01-23 14:25:25,258 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-23 14:25:25,262 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:25,262 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-23 14:25:25,263 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_topErr0EnsuresViolation]=== [2018-01-23 14:25:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash -127396070, now seen corresponding path program 1 times [2018-01-23 14:25:25,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:25,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:25,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:25,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:25:25,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:25,309 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-23 14:25:25,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:25,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:25:25,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:25,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2018-01-23 14:25:25,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:25,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:25,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:25,390 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:25,396 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:25,396 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2018-01-23 14:25:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:25,397 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:25,397 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:25:25,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 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-23 14:25:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:25:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:25:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:25:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-23 14:25:25,403 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 45 [2018-01-23 14:25:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:25,403 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-23 14:25:25,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-23 14:25:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-23 14:25:25,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:25,404 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-23 14:25:25,404 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_topErr0EnsuresViolation]=== [2018-01-23 14:25:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1858165626, now seen corresponding path program 1 times [2018-01-23 14:25:25,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:25,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:25,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:25,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:25,505 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-23 14:25:25,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:25,505 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-23 14:25:25,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:25,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:25,616 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-23 14:25:25,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:25:25,652 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-23 14:25:25,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:25:25,659 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-23 14:25:25,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-23 14:25:25,735 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-23 14:25:25,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:25,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-23 14:25:25,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:25:25,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:25:25,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=18, Unknown=3, NotChecked=8, Total=42 [2018-01-23 14:25:25,756 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-01-23 14:25:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:25,946 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-23 14:25:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:25:25,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-01-23 14:25:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:25,947 INFO L225 Difference]: With dead ends: 86 [2018-01-23 14:25:25,947 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:25,948 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=26, Unknown=3, NotChecked=10, Total=56 [2018-01-23 14:25:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:25,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-01-23 14:25:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:25,949 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:25,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:25:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:25,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:25,951 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:25,951 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:25,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:25,951 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:25,951 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:25,951 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:25,951 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:25,951 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_subErr0EnsuresViolation======== [2018-01-23 14:25:25,951 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:25:25,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:25,954 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-23 14:25:25,954 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_subErr0EnsuresViolation]=== [2018-01-23 14:25:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash 673138463, now seen corresponding path program 1 times [2018-01-23 14:25:25,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:25,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:25,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:25,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:25,972 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-23 14:25:25,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:25,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:25,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:25,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:25,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:25,973 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:25,980 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:25,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:25,981 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-23 14:25:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:25,982 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:25,982 INFO L226 Difference]: Without dead ends: 78 [2018-01-23 14:25:25,983 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-23 14:25:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-23 14:25:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-23 14:25:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-23 14:25:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-23 14:25:25,991 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 27 [2018-01-23 14:25:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:25,991 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-23 14:25:25,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-23 14:25:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-23 14:25:25,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:25,994 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-23 14:25:25,994 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_subErr0EnsuresViolation]=== [2018-01-23 14:25:25,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1952480154, now seen corresponding path program 1 times [2018-01-23 14:25:25,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:25,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:25,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:25,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:25,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:26,121 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-23 14:25:26,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:26,122 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-23 14:25:26,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:26,241 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-23 14:25:26,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:26,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-23 14:25:26,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:25:26,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:25:26,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:25:26,270 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 4 states. [2018-01-23 14:25:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:26,338 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-23 14:25:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:25:26,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-01-23 14:25:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:26,338 INFO L225 Difference]: With dead ends: 110 [2018-01-23 14:25:26,339 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:26,339 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-23 14:25:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:26,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-01-23 14:25:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:26,340 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:26,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:25:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:26,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:26,341 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:26,342 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:26,342 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:26,342 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:26,342 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:26,342 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:26,342 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:26,342 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_sub_listErr0EnsuresViolation======== [2018-01-23 14:25:26,342 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:25:26,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:26,344 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-23 14:25:26,344 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_sub_listErr0EnsuresViolation]=== [2018-01-23 14:25:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 584331388, now seen corresponding path program 1 times [2018-01-23 14:25:26,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:26,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:26,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:26,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:26,365 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-23 14:25:26,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:26,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:26,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:26,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:26,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:26,366 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:26,373 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:26,373 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-23 14:25:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:26,374 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:26,374 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:25:26,375 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-23 14:25:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:25:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:25:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:25:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-23 14:25:26,380 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 22 [2018-01-23 14:25:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:26,381 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-23 14:25:26,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-23 14:25:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:25:26,382 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:26,382 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-23 14:25:26,382 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_sub_listErr0EnsuresViolation]=== [2018-01-23 14:25:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1395666505, now seen corresponding path program 1 times [2018-01-23 14:25:26,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:26,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:26,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:26,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:26,456 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-23 14:25:26,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:26,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:26,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:25:26,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:25:26,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:25:26,458 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 3 states. [2018-01-23 14:25:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:26,507 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-23 14:25:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:25:26,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-23 14:25:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:26,508 INFO L225 Difference]: With dead ends: 54 [2018-01-23 14:25:26,509 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:26,509 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-23 14:25:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:26,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-23 14:25:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:26,510 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:26,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:25:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:26,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:26,511 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:26,512 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:26,512 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:26,512 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:26,512 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:26,512 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:26,512 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:26,512 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:25:26,512 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:25:26,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:26,514 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-23 14:25:26,514 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:25:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1772916773, now seen corresponding path program 1 times [2018-01-23 14:25:26,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:26,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:26,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:26,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:26,527 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-23 14:25:26,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:26,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:26,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:26,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:26,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:26,528 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:26,534 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:26,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-23 14:25:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:26,536 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:26,536 INFO L226 Difference]: Without dead ends: 86 [2018-01-23 14:25:26,536 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-23 14:25:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-23 14:25:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-23 14:25:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-23 14:25:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-23 14:25:26,544 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 26 [2018-01-23 14:25:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:26,544 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-23 14:25:26,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-23 14:25:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-23 14:25:26,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:26,545 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-23 14:25:26,546 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:25:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1417640009, now seen corresponding path program 1 times [2018-01-23 14:25:26,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:26,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:26,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:26,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:26,624 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-23 14:25:26,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:26,625 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-23 14:25:26,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:26,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:26,737 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-23 14:25:26,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:25:26,758 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-23 14:25:26,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:25:26,761 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-23 14:25:26,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-23 14:25:26,842 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-23 14:25:26,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:26,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-23 14:25:26,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:25:26,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:25:26,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=18, Unknown=3, NotChecked=8, Total=42 [2018-01-23 14:25:26,869 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 7 states. [2018-01-23 14:25:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:26,992 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-23 14:25:26,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:25:26,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-01-23 14:25:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:26,993 INFO L225 Difference]: With dead ends: 118 [2018-01-23 14:25:26,994 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:26,994 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=26, Unknown=3, NotChecked=10, Total=56 [2018-01-23 14:25:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:26,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-01-23 14:25:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:26,996 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:26,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:25:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:26,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:27,000 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:27,000 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:27,000 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:27,001 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:27,001 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:27,001 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:27,001 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:27,001 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:25:27,001 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:25:27,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:27,005 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-23 14:25:27,005 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1285304546, now seen corresponding path program 1 times [2018-01-23 14:25:27,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:27,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:27,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:27,021 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-23 14:25:27,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:27,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:27,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:27,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:27,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:27,022 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:27,029 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:27,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:25:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:27,031 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:27,031 INFO L226 Difference]: Without dead ends: 84 [2018-01-23 14:25:27,032 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-23 14:25:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-23 14:25:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-23 14:25:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-23 14:25:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-23 14:25:27,040 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 24 [2018-01-23 14:25:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:27,041 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-23 14:25:27,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-23 14:25:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-23 14:25:27,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:27,043 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-23 14:25:27,043 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash -23821520, now seen corresponding path program 1 times [2018-01-23 14:25:27,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:27,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:27,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:27,136 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-23 14:25:27,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:27,137 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-23 14:25:27,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:27,259 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-23 14:25:27,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:25:27,268 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-23 14:25:27,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:25:27,272 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-23 14:25:27,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-23 14:25:27,333 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-23 14:25:27,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:27,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-23 14:25:27,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:25:27,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:25:27,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-23 14:25:27,370 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-01-23 14:25:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:27,553 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-01-23 14:25:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:25:27,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-01-23 14:25:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:27,554 INFO L225 Difference]: With dead ends: 116 [2018-01-23 14:25:27,554 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:27,555 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-23 14:25:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:27,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-01-23 14:25:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:27,556 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:27,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:25:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:27,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:27,557 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:27,557 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:27,558 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:27,558 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:27,558 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:27,558 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:27,558 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:27,558 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == list_add_tailErr0EnsuresViolation======== [2018-01-23 14:25:27,558 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-23 14:25:27,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:27,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:27,560 INFO L371 AbstractCegarLoop]: === Iteration 1 === [list_add_tailErr0EnsuresViolation]=== [2018-01-23 14:25:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1965822616, now seen corresponding path program 1 times [2018-01-23 14:25:27,561 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:27,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:27,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:27,585 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-23 14:25:27,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:27,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:27,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:27,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:27,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:27,586 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:27,592 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:27,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:27,592 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-01-23 14:25:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:27,593 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:27,593 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:27,594 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-23 14:25:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:27,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-23 14:25:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:27,594 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:27,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:27,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:27,596 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:27,596 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:27,596 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:27,596 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:27,596 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:27,596 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:27,597 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:27,597 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_topErr0EnsuresViolation======== [2018-01-23 14:25:27,597 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-23 14:25:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:25:27,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:27,598 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-23 14:25:27,598 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_topErr0EnsuresViolation]=== [2018-01-23 14:25:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash 719208377, now seen corresponding path program 1 times [2018-01-23 14:25:27,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:27,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:27,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:27,609 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-23 14:25:27,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:27,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:27,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:27,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:27,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:27,610 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-23 14:25:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:27,616 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-23 14:25:27,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:27,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-23 14:25:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:27,617 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:25:27,617 INFO L226 Difference]: Without dead ends: 79 [2018-01-23 14:25:27,618 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-23 14:25:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-23 14:25:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-23 14:25:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:25:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-23 14:25:27,625 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 19 [2018-01-23 14:25:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:27,625 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-23 14:25:27,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-23 14:25:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-23 14:25:27,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:27,626 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-23 14:25:27,627 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_topErr0EnsuresViolation]=== [2018-01-23 14:25:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1592932249, now seen corresponding path program 1 times [2018-01-23 14:25:27,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:27,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:27,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:27,694 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-23 14:25:27,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:27,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:25:27,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:27,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:27,804 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-23 14:25:27,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:27,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-23 14:25:27,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:25:27,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:25:27,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:25:27,837 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 4 states. [2018-01-23 14:25:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:27,896 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-23 14:25:27,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:25:27,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-01-23 14:25:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:27,897 INFO L225 Difference]: With dead ends: 111 [2018-01-23 14:25:27,897 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:27,898 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-23 14:25:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:27,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-01-23 14:25:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:27,899 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:27,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:25:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:27,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:27,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:25:27 BoogieIcfgContainer [2018-01-23 14:25:27,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:25:27,903 INFO L168 Benchmark]: Toolchain (without parser) took 4732.38 ms. Allocated memory was 306.7 MB in the beginning and 524.8 MB in the end (delta: 218.1 MB). Free memory was 264.0 MB in the beginning and 332.8 MB in the end (delta: -68.8 MB). Peak memory consumption was 149.3 MB. Max. memory is 5.3 GB. [2018-01-23 14:25:27,905 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:25:27,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.03 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:25:27,905 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 306.7 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:25:27,906 INFO L168 Benchmark]: RCFGBuilder took 399.60 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 223.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:25:27,906 INFO L168 Benchmark]: TraceAbstraction took 4059.38 ms. Allocated memory was 306.7 MB in the beginning and 524.8 MB in the end (delta: 218.1 MB). Free memory was 223.3 MB in the beginning and 332.8 MB in the end (delta: -109.5 MB). Peak memory consumption was 108.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:25:27,908 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.19 ms. Allocated memory is still 306.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.03 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 306.7 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 399.60 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 223.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4059.38 ms. Allocated memory was 306.7 MB in the beginning and 524.8 MB in the end (delta: 218.1 MB). Free memory was 223.3 MB in the beginning and 332.8 MB in the end (delta: -109.5 MB). Peak memory consumption was 108.6 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, 97 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 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=97occurred 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, 26 LocationsWithAnnotation, 53 PreInvPairs, 66 NumberOfFragments, 26 HoareAnnotationTreeSize, 53 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 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: 664]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L697] FCALL struct list_head top = { &(top), &(top) }; VAL [top={33:0}] [L698] CALL create_top(&top) VAL [top={33:0}] [L692] CALL insert_top(top) VAL [head={33:0}] [L682] EXPR, FCALL malloc(sizeof(*top)) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}] [L682] struct top_list *top = malloc(sizeof(*top)); VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L683] COND FALSE !(!top) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L685] CALL create_sub_list(&top->sub1) VAL [sub={38:8}] [L674] FCALL sub->prev = sub VAL [sub={38:8}, sub={38:8}] [L675] FCALL sub->next = sub VAL [sub={38:8}, sub={38:8}] [L677] CALL insert_sub(sub) VAL [head={38:8}] [L666] EXPR, FCALL malloc(sizeof(*sub)) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}] [L666] struct sub_list *sub = malloc(sizeof(*sub)); VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L667] COND FALSE !(!sub) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L669] FCALL sub->number = 0 VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L670] 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}] [L670] 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, 97 locations, 11 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 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=97occurred 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, 97 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=97occurred 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: 689]: 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, 97 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 19 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=97occurred 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.1s 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: 680]: 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, 97 locations, 11 error locations. SAFE Result, 0.6s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 39 SDslu, 25 SDs, 0 SdLazy, 54 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 272 ConstructedInterpolants, 18 QuantifiedInterpolants, 34416 SizeOfPredicates, 3 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 110/124 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, 97 locations, 11 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 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=97occurred 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, 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: 672]: 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, 97 locations, 11 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 148 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=97occurred 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, 97 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 43 SDslu, 17 SDs, 0 SdLazy, 37 SolverSat, 22 SolverUnsat, 0 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=97occurred 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: 695]: 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, 97 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 39 SDslu, 25 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 2 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=97occurred 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, 97 locations, 11 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 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=97occurred 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, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 1521 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 - 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, 97 locations, 11 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 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=97occurred 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, 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: 691]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 657]: 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_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-23_14-25-27-922.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-23_14-25-27-922.csv Received shutdown request...