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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:09:48,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:09:48,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:09:48,891 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:09:48,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:09:48,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:09:48,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:09:48,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:09:48,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:09:48,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:09:48,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:09:48,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:09:48,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:09:48,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:09:48,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:09:48,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:09:48,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:09:48,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:09:48,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:09:48,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:09:48,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:09:48,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:09:48,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:09:48,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:09:48,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:09:48,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:09:48,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:09:48,920 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:09:48,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:09:48,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:09:48,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:09:48,921 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:09:48,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:09:48,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:09:48,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:09:48,932 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:09:48,932 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:09:48,932 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:09:48,933 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:09:48,933 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:09:48,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:09:48,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:09:48,934 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:09:48,934 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:09:48,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:09:48,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:09:48,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:09:48,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:09:48,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:09:48,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:09:48,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:09:48,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:09:48,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:09:48,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:09:48,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:09:48,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:09:48,937 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:09:48,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:09:48,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:09:48,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:09:48,937 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:09:48,937 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:09:48,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:09:48,938 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:09:48,938 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:09:48,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:09:48,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:09:48,939 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:09:48,939 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:09:48,940 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:09:48,940 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:09:48,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:09:48,983 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:09:48,986 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:09:48,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:09:48,988 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:09:48,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-01-21 10:09:49,208 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:09:49,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:09:49,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:09:49,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:09:49,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:09:49,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb5cd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49, skipping insertion in model container [2018-01-21 10:09:49,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,236 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:09:49,286 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:09:49,425 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:09:49,456 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:09:49,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49 WrapperNode [2018-01-21 10:09:49,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:09:49,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:09:49,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:09:49,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:09:49,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (1/1) ... [2018-01-21 10:09:49,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:09:49,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:09:49,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:09:49,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:09:49,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (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-21 10:09:49,575 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:09:49,575 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:09:49,575 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-01-21 10:09:49,575 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-01-21 10:09:49,576 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:09:49,576 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:09:49,576 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:09:49,576 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-21 10:09:49,577 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 10:09:49,577 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:09:49,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:09:49,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:09:50,084 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:09:50,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:09:50 BoogieIcfgContainer [2018-01-21 10:09:50,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:09:50,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:09:50,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:09:50,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:09:50,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:09:49" (1/3) ... [2018-01-21 10:09:50,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d9295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:09:50, skipping insertion in model container [2018-01-21 10:09:50,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:09:49" (2/3) ... [2018-01-21 10:09:50,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d9295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:09:50, skipping insertion in model container [2018-01-21 10:09:50,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:09:50" (3/3) ... [2018-01-21 10:09:50,091 INFO L105 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-01-21 10:09:50,098 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:09:50,105 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-21 10:09:50,147 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:09:50,147 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:09:50,147 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:09:50,148 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:09:50,148 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:09:50,148 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:09:50,148 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:09:50,148 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFnewErr0EnsuresViolation======== [2018-01-21 10:09:50,149 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:09:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:09:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:09:50,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,178 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-21 10:09:50,178 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:09:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1285108215, now seen corresponding path program 1 times [2018-01-21 10:09:50,187 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:50,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:50,503 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-21 10:09:50,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:50,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:09:50,505 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:50,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:09:50,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:09:50,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:09:50,521 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 4 states. [2018-01-21 10:09:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:50,640 INFO L93 Difference]: Finished difference Result 329 states and 416 transitions. [2018-01-21 10:09:50,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:09:50,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-21 10:09:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:50,652 INFO L225 Difference]: With dead ends: 329 [2018-01-21 10:09:50,652 INFO L226 Difference]: Without dead ends: 103 [2018-01-21 10:09:50,660 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:09:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-21 10:09:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-01-21 10:09:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-21 10:09:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2018-01-21 10:09:50,708 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2018-01-21 10:09:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:50,708 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2018-01-21 10:09:50,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:09:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2018-01-21 10:09:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 10:09:50,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:50,710 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] [2018-01-21 10:09:50,710 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:09:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash 824169485, now seen corresponding path program 1 times [2018-01-21 10:09:50,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:50,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:50,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:50,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:50,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:50,888 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-21 10:09:50,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:09:50,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:09:50,889 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:09:50,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:09:50,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:09:50,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:09:50,891 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 6 states. [2018-01-21 10:09:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:09:51,036 INFO L93 Difference]: Finished difference Result 189 states and 223 transitions. [2018-01-21 10:09:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:09:51,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-21 10:09:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:09:51,040 INFO L225 Difference]: With dead ends: 189 [2018-01-21 10:09:51,040 INFO L226 Difference]: Without dead ends: 106 [2018-01-21 10:09:51,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:09:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-21 10:09:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-01-21 10:09:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-21 10:09:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2018-01-21 10:09:51,052 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 28 [2018-01-21 10:09:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:09:51,053 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2018-01-21 10:09:51,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:09:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2018-01-21 10:09:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:09:51,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:09:51,054 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] [2018-01-21 10:09:51,054 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:09:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2128486935, now seen corresponding path program 1 times [2018-01-21 10:09:51,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:09:51,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:09:51,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:09:51,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:09:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:09:51,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:09:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:09:51,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:09:51,175 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:09:51,176 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-21 10:09:51,179 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [7], [8], [9], [11], [15], [16], [17], [19], [20], [24], [26], [27], [36], [37], [38], [39], [197], [198], [216], [217], [218], [288], [289], [290] [2018-01-21 10:09:51,244 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:09:51,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:10:05,529 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:10:05,531 INFO L268 AbstractInterpreter]: Visited 29 different actions 37 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-21 10:10:05,547 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:10:05,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:05,547 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:05,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:05,560 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:05,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:05,651 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:05,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:05,856 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:05,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:05,860 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:05,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:05,910 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:05,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:05,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 15 [2018-01-21 10:10:05,972 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:05,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 10:10:05,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 10:10:05,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-21 10:10:05,973 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 10 states. [2018-01-21 10:10:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:06,160 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2018-01-21 10:10:06,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 10:10:06,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-21 10:10:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:06,209 INFO L225 Difference]: With dead ends: 211 [2018-01-21 10:10:06,209 INFO L226 Difference]: Without dead ends: 125 [2018-01-21 10:10:06,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-01-21 10:10:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-21 10:10:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-01-21 10:10:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-21 10:10:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2018-01-21 10:10:06,223 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 29 [2018-01-21 10:10:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:06,223 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2018-01-21 10:10:06,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 10:10:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2018-01-21 10:10:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:10:06,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:06,224 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:10:06,224 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash -387345075, now seen corresponding path program 2 times [2018-01-21 10:10:06,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:06,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:06,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:06,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:06,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:06,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:06,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:06,348 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:06,348 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:06,348 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:06,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:06,348 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:06,358 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:10:06,359 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:06,378 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:06,386 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:06,387 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:06,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:06,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:06,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:06,729 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:06,732 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:10:06,732 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:06,757 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:06,870 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:06,885 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:06,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:06,896 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:07,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:07,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 17 [2018-01-21 10:10:07,078 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:07,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:10:07,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:10:07,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-21 10:10:07,079 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 11 states. [2018-01-21 10:10:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:07,366 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2018-01-21 10:10:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 10:10:07,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-21 10:10:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:07,367 INFO L225 Difference]: With dead ends: 230 [2018-01-21 10:10:07,367 INFO L226 Difference]: Without dead ends: 128 [2018-01-21 10:10:07,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-01-21 10:10:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-21 10:10:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-01-21 10:10:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-21 10:10:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2018-01-21 10:10:07,380 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 30 [2018-01-21 10:10:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:07,381 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-01-21 10:10:07,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:10:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2018-01-21 10:10:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 10:10:07,382 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:07,382 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 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-21 10:10:07,382 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1068726057, now seen corresponding path program 3 times [2018-01-21 10:10:07,383 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:07,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:07,384 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:07,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:07,384 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:07,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:07,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:07,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:07,641 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:07,641 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:07,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:07,642 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:07,649 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:10:07,649 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:10:07,666 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:07,676 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:07,701 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:07,702 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:07,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:07,725 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:07,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:07,840 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:07,843 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 10:10:07,843 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 10:10:07,865 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:07,970 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:08,130 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 10:10:08,147 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:08,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:08,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 18 [2018-01-21 10:10:08,223 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:08,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 10:10:08,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 10:10:08,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-01-21 10:10:08,224 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand 12 states. [2018-01-21 10:10:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:08,343 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2018-01-21 10:10:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-21 10:10:08,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-21 10:10:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:08,344 INFO L225 Difference]: With dead ends: 234 [2018-01-21 10:10:08,344 INFO L226 Difference]: Without dead ends: 131 [2018-01-21 10:10:08,345 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2018-01-21 10:10:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-21 10:10:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-21 10:10:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-21 10:10:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2018-01-21 10:10:08,354 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 31 [2018-01-21 10:10:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:08,354 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2018-01-21 10:10:08,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 10:10:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2018-01-21 10:10:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:10:08,355 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:08,355 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 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-21 10:10:08,356 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash -716700019, now seen corresponding path program 4 times [2018-01-21 10:10:08,356 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:08,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:08,357 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:08,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:08,357 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:08,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:08,469 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:08,469 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:08,469 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:08,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:08,469 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:10:08,475 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:10:08,475 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:10:08,500 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:08,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,532 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:08,699 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:08,702 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 10:10:08,702 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 10:10:08,792 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:08,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,804 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:08,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:08,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 19 [2018-01-21 10:10:08,900 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:08,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 10:10:08,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 10:10:08,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-01-21 10:10:08,901 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand 13 states. [2018-01-21 10:10:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:09,032 INFO L93 Difference]: Finished difference Result 238 states and 283 transitions. [2018-01-21 10:10:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-21 10:10:09,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-21 10:10:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:09,033 INFO L225 Difference]: With dead ends: 238 [2018-01-21 10:10:09,033 INFO L226 Difference]: Without dead ends: 134 [2018-01-21 10:10:09,034 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-01-21 10:10:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-21 10:10:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 124. [2018-01-21 10:10:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-21 10:10:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2018-01-21 10:10:09,042 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 32 [2018-01-21 10:10:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:09,043 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2018-01-21 10:10:09,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 10:10:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2018-01-21 10:10:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 10:10:09,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:09,044 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 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-21 10:10:09,044 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1606172567, now seen corresponding path program 5 times [2018-01-21 10:10:09,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:09,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:09,045 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:09,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:09,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:09,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:09,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:09,165 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:09,165 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:09,166 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:09,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:09,166 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:09,172 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 10:10:09,172 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:09,178 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,180 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,184 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,201 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,203 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:09,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:09,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:09,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:09,477 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:09,480 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 10:10:09,481 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:10:09,490 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,495 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,505 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,535 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:10:09,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:09,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:09,567 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:09,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:09,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 21 [2018-01-21 10:10:09,681 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:09,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-21 10:10:09,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-21 10:10:09,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-01-21 10:10:09,682 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 14 states. [2018-01-21 10:10:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:09,890 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2018-01-21 10:10:09,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 10:10:09,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-01-21 10:10:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:09,892 INFO L225 Difference]: With dead ends: 242 [2018-01-21 10:10:09,893 INFO L226 Difference]: Without dead ends: 137 [2018-01-21 10:10:09,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2018-01-21 10:10:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-21 10:10:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2018-01-21 10:10:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-21 10:10:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2018-01-21 10:10:09,907 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 33 [2018-01-21 10:10:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:09,907 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2018-01-21 10:10:09,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-21 10:10:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2018-01-21 10:10:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 10:10:09,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:09,908 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 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-21 10:10:09,908 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash 600778701, now seen corresponding path program 6 times [2018-01-21 10:10:09,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:09,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:09,910 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:09,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:09,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:09,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:10,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:10,109 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:10,109 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:10,109 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:10,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:10,110 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:10,120 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 10:10:10,121 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 10:10:10,139 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,147 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,165 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,269 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,270 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:10,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:10,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:10,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:10,527 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:10,530 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 10:10:10,530 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 10:10:10,554 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,655 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,767 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:10,994 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 10:10:11,013 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:10:11,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,023 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:11,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 23 [2018-01-21 10:10:11,136 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:11,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-21 10:10:11,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-21 10:10:11,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-01-21 10:10:11,138 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 15 states. [2018-01-21 10:10:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:11,347 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2018-01-21 10:10:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-21 10:10:11,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-21 10:10:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:11,349 INFO L225 Difference]: With dead ends: 246 [2018-01-21 10:10:11,349 INFO L226 Difference]: Without dead ends: 140 [2018-01-21 10:10:11,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2018-01-21 10:10:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-21 10:10:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-01-21 10:10:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 10:10:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-01-21 10:10:11,359 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 34 [2018-01-21 10:10:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:11,359 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-01-21 10:10:11,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-21 10:10:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-01-21 10:10:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 10:10:11,360 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:11,361 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 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-21 10:10:11,361 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash -501660073, now seen corresponding path program 7 times [2018-01-21 10:10:11,361 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:11,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:11,362 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:10:11,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:11,362 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:11,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:11,479 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:11,479 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:10:11,479 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:10:11,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:11,479 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:10:11,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:11,487 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:11,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,534 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:11,774 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:10:11,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:11,777 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:10:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:11,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:10:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,824 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:10:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:10:11,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:10:11,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 24 [2018-01-21 10:10:11,915 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:10:11,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-21 10:10:11,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-21 10:10:11,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-01-21 10:10:11,917 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 16 states. [2018-01-21 10:10:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:10:12,180 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2018-01-21 10:10:12,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-21 10:10:12,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-01-21 10:10:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:10:12,182 INFO L225 Difference]: With dead ends: 250 [2018-01-21 10:10:12,182 INFO L226 Difference]: Without dead ends: 143 [2018-01-21 10:10:12,183 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 121 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=795, Unknown=0, NotChecked=0, Total=1122 [2018-01-21 10:10:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-21 10:10:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2018-01-21 10:10:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-21 10:10:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-01-21 10:10:12,191 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 35 [2018-01-21 10:10:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:10:12,191 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-01-21 10:10:12,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-21 10:10:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-01-21 10:10:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 10:10:12,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:12,192 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 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-21 10:10:12,192 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr0EnsuresViolation]=== [2018-01-21 10:10:12,193 INFO L82 PathProgramCache]: Analyzing trace with hash -317523699, now seen corresponding path program 8 times [2018-01-21 10:10:12,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:12,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:12,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:12,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:12,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:10:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:10:12,263 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:10:12,275 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:10:12,279 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-21 10:10:12,281 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:10:12,296 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:12,296 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:12,296 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:12,296 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:12,296 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:12,296 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:12,297 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:12,297 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFexgcdErr0EnsuresViolation======== [2018-01-21 10:10:12,297 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-21 10:10:12,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:10:12,301 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-01-21 10:10:12,301 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFexgcdErr0EnsuresViolation]=== [2018-01-21 10:10:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2095005952, now seen corresponding path program 1 times [2018-01-21 10:10:12,302 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:10:12,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:12,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:10:12,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:10:12,303 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:10:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:10:12,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:10:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-21 10:10:12,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:10:12,464 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:10:12,464 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-01-21 10:10:12,464 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [13], [15], [16], [17], [18], [28], [29], [30], [31], [36], [37], [38], [39], [41], [42], [43], [44], [45], [47], [48], [49], [50], [51], [60], [62], [64], [70], [72], [75], [83], [87], [88], [91], [196], [197], [198], [218], [219], [220], [221], [222], [224], [225], [226], [227], [230], [231], [288], [289], [290] [2018-01-21 10:10:12,467 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:10:12,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:10:18,128 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 10:10:18,128 INFO L268 AbstractInterpreter]: Visited 19 different actions 19 times. Never merged. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-01-21 10:10:18,137 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 10:10:21,109 INFO L232 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 56.3% of their original sizes. [2018-01-21 10:10:21,109 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 10:10:21,307 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse30 (+ c_DUPFFnew_~ans~6.offset 8))) (let ((.cse0 (select |c_old(#valid)| 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base) .cse30)) (.cse17 (select |c_#valid| c_DUPFFnew_~ans~6.base)) (.cse19 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base)) (.cse18 (select (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base) .cse30))) (and (not (= |c_#length| |c_old(#valid)|)) (not (= 0 c_DUPFFnew_~ans~6.base)) (= .cse0 .cse1) (forall ((v_weq0_2 Int)) (let ((.cse13 (select |c_old(#valid)| v_weq0_2)) (.cse11 (select |c_#valid| v_weq0_2))) (or (let ((.cse14 (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base)) (.cse15 (select |c_#memory_$Pointer$.offset| v_weq0_2)) (.cse10 (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base)) (.cse5 (+ c_DUPFFnew_~ans~6.offset 8))) (let ((.cse2 (select |c_old(#valid)| 0)) (.cse4 (select |c_#memory_int| c_DUPFFnew_~ans~6.base)) (.cse6 (select |c_#memory_int| v_weq0_2)) (.cse9 (select |c_#length| c_DUPFFnew_~ans~6.base)) (.cse3 (select .cse10 .cse5)) (.cse7 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base)) (.cse8 (select .cse15 .cse5)) (.cse12 (select .cse14 .cse5)) (.cse16 (select |c_#valid| c_DUPFFnew_~ans~6.base))) (and (not (= 0 c_DUPFFnew_~ans~6.base)) (= .cse2 .cse3) (= (select .cse4 .cse5) (select .cse6 .cse5)) (= .cse7 .cse8) (= (select |c_#length| v_weq0_2) .cse9) (= c_DUPFFnew_~ans~6.offset .cse2) (= (select |c_#memory_$Pointer$.base| v_weq0_2) .cse10) (= .cse4 .cse6) (= .cse9 12) (= v_weq0_2 c_DUPFFnew_~ans~6.base) (= 0 c_DUPFFnew_~ans~6.offset) (not (= c_DUPFFnew_~ans~6.base 0)) (= 1 .cse11) (= .cse12 (select |c_#valid| 0)) (= .cse3 .cse7) (= .cse8 .cse13) (= .cse14 .cse15) (= .cse13 .cse12) (= .cse16 c_DUPFFnew_~maxdeg) (= .cse11 .cse16)))) (= .cse13 .cse11)))) (= c_DUPFFnew_~ans~6.offset .cse0) (= (select |c_#length| c_DUPFFnew_~ans~6.base) 12) (= 0 c_DUPFFnew_~ans~6.offset) (= 1 .cse17) (= .cse18 (select |c_#valid| 0)) (= .cse1 .cse19) (not (= |c_#valid| |c_#length|)) (forall ((v_weq0_2 Int)) (or (= (select (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base) v_weq0_2) (select (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base) v_weq0_2)) (not (= v_weq0_2 (+ c_DUPFFnew_~ans~6.offset 8))))) (= .cse17 c_DUPFFnew_~maxdeg) (forall ((v_weq0_2 Int) (v_weq1_2 Int)) (let ((.cse20 (+ c_DUPFFnew_~ans~6.offset 8))) (or (not (= v_weq0_2 c_DUPFFnew_~ans~6.base)) (not (= v_weq1_2 .cse20)) (= (select (select |c_#memory_$Pointer$.base| v_weq0_2) v_weq1_2) (select (select |c_#memory_$Pointer$.offset| v_weq0_2) v_weq1_2)) (let ((.cse29 (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base)) (.cse28 (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base))) (let ((.cse22 (select |c_#valid| 0)) (.cse23 (select .cse28 .cse20)) (.cse27 (select |c_old(#valid)| 0)) (.cse25 (select .cse29 v_weq1_2)) (.cse24 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base)) (.cse21 (select .cse29 .cse20))) (and (= .cse21 .cse22) (= .cse23 .cse24) (not (= 0 c_DUPFFnew_~ans~6.base)) (= .cse22 .cse25) (let ((.cse26 (select |c_#memory_int| c_DUPFFnew_~ans~6.base))) (= (select .cse26 v_weq1_2) (select .cse26 .cse20))) (= .cse27 .cse23) (= c_DUPFFnew_~ans~6.offset .cse27) (= .cse25 (select .cse28 v_weq1_2)) (= .cse24 .cse21) (= .cse20 v_weq1_2) (= 0 c_DUPFFnew_~ans~6.offset) (not (= c_DUPFFnew_~ans~6.base 0)))))))) (= .cse19 .cse18) (not (= |c_#valid| |c_old(#valid)|))))) is different from false [2018-01-21 10:10:21,328 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| c_DUPFFnew_~ans~6.base))) (let ((.cse19 (select |c_old(#valid)| 0)) (.cse22 (select .cse21 c_DUPFFnew_~ans~6.offset)) (.cse20 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base))) (and (not (= |c_#length| |c_old(#valid)|)) (not (= 0 c_DUPFFnew_~ans~6.base)) (forall ((v_weq0_2 Int)) (let ((.cse1 (select |c_#valid| v_weq0_2)) (.cse0 (select |c_old(#valid)| v_weq0_2))) (or (= .cse0 .cse1) (let ((.cse9 (select |c_#memory_int| v_weq0_2)) (.cse10 (select |c_#memory_$Pointer$.offset| v_weq0_2)) (.cse8 (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base)) (.cse3 (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base)) (.cse16 (select |c_#memory_int| c_DUPFFnew_~ans~6.base)) (.cse7 (select |c_#memory_$Pointer$.base| v_weq0_2))) (let ((.cse5 (select |c_#length| c_DUPFFnew_~ans~6.base)) (.cse11 (select .cse7 .cse0)) (.cse2 (select .cse16 .cse0)) (.cse4 (select .cse3 .cse0)) (.cse12 (select .cse8 .cse0)) (.cse6 (select |c_old(#valid)| 0)) (.cse15 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base)) (.cse14 (select .cse10 c_DUPFFnew_~ans~6.offset)) (.cse17 (select .cse9 .cse0)) (.cse13 (select .cse9 c_DUPFFnew_~ans~6.offset)) (.cse18 (select .cse16 c_DUPFFnew_~ans~6.offset))) (and (= .cse1 .cse2) (= (select .cse3 c_DUPFFnew_~ans~6.offset) .cse4) (not (= 0 c_DUPFFnew_~ans~6.base)) (= (select |c_#length| v_weq0_2) .cse5) (= c_DUPFFnew_~ans~6.offset .cse6) (= .cse7 .cse8) (= .cse5 12) (= v_weq0_2 c_DUPFFnew_~ans~6.base) (not (= .cse9 |c_old(#valid)|)) (= .cse0 (select |c_#valid| 0)) (= 0 c_DUPFFnew_~ans~6.offset) (not (= c_DUPFFnew_~ans~6.base 0)) (= .cse3 .cse10) (= .cse11 (select .cse8 c_DUPFFnew_~ans~6.offset)) (= .cse12 .cse11) (= .cse2 .cse13) (= .cse4 .cse14) (= .cse15 .cse0) (not (= .cse9 |c_#valid|)) (= (select .cse7 c_DUPFFnew_~ans~6.offset) .cse12) (= .cse16 .cse9) (= .cse6 .cse15) (= .cse14 (select .cse10 .cse0)) (= .cse17 .cse1) (= .cse18 .cse17) (= .cse13 (select |c_#valid| c_DUPFFnew_~ans~6.base)) (= 1 .cse18))))))) (= c_DUPFFnew_~ans~6.offset .cse19) (= (select |c_#length| c_DUPFFnew_~ans~6.base) 12) (= .cse19 .cse20) (= 0 c_DUPFFnew_~ans~6.offset) (not (= .cse21 |c_#valid|)) (not (= |c_#valid| |c_#length|)) (not (= .cse21 |c_old(#valid)|)) (= 1 .cse22) (forall ((v_weq0_2 Int) (v_weq1_2 Int)) (let ((.cse32 (select |c_#memory_$Pointer$.base| v_weq0_2)) (.cse37 (select |c_#memory_$Pointer$.offset| v_weq0_2))) (let ((.cse23 (= v_weq0_2 c_DUPFFnew_~ans~6.base)) (.cse25 (select .cse37 v_weq1_2)) (.cse24 (select .cse32 v_weq1_2))) (or (not .cse23) (not (= v_weq1_2 (+ c_DUPFFnew_~ans~6.offset 8))) (= .cse24 .cse25) (let ((.cse34 (select |c_#memory_int| v_weq0_2)) (.cse36 (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base)) (.cse43 (select |c_#memory_int| c_DUPFFnew_~ans~6.base)) (.cse35 (select |c_old(#valid)| v_weq0_2)) (.cse29 (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base))) (let ((.cse30 (select |c_#length| c_DUPFFnew_~ans~6.base)) (.cse28 (select .cse29 c_DUPFFnew_~ans~6.offset)) (.cse27 (select .cse43 .cse35)) (.cse31 (select |c_old(#valid)| 0)) (.cse33 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base)) (.cse39 (select .cse32 .cse35)) (.cse42 (select .cse37 c_DUPFFnew_~ans~6.offset)) (.cse38 (select .cse37 .cse35)) (.cse26 (select |c_#valid| v_weq0_2)) (.cse41 (select .cse36 .cse35)) (.cse45 (select .cse34 .cse35)) (.cse40 (select .cse34 c_DUPFFnew_~ans~6.offset)) (.cse46 (select |c_#valid| c_DUPFFnew_~ans~6.base)) (.cse47 (select .cse43 c_DUPFFnew_~ans~6.offset)) (.cse44 (select .cse29 .cse35))) (and (= .cse26 .cse27) (= .cse28 (select .cse29 v_weq1_2)) (= (select |c_#length| v_weq0_2) .cse30) (= c_DUPFFnew_~ans~6.offset .cse31) (= .cse32 .cse29) (= v_weq1_2 .cse33) (= .cse30 12) .cse23 (not (= .cse34 |c_old(#valid)|)) (= .cse35 (select |c_#valid| 0)) (= 0 c_DUPFFnew_~ans~6.offset) (not (= c_DUPFFnew_~ans~6.base 0)) (= .cse36 .cse37) (= .cse38 (select .cse36 v_weq1_2)) (= .cse39 .cse28) (= .cse27 .cse40) (= .cse41 .cse42) (= .cse31 v_weq1_2) (= (select .cse43 v_weq1_2) 1) (= .cse33 .cse35) (not (= .cse34 |c_#valid|)) (= (select .cse32 c_DUPFFnew_~ans~6.offset) .cse44) (= .cse43 .cse34) (= .cse24 .cse39) (= .cse42 .cse38) (= (select .cse36 c_DUPFFnew_~ans~6.offset) .cse25) (= .cse45 .cse26) (= .cse46 (select .cse34 v_weq1_2)) (= .cse25 .cse41) (= .cse47 .cse45) (= .cse40 .cse46) (= 1 .cse47) (= .cse44 .cse24)))))))) (forall ((v_weq0_2 Int)) (let ((.cse55 (select |c_#memory_$Pointer$.offset| c_DUPFFnew_~ans~6.base)) (.cse52 (select |c_#memory_$Pointer$.base| c_DUPFFnew_~ans~6.base))) (let ((.cse48 (select .cse52 v_weq0_2)) (.cse49 (select .cse55 v_weq0_2))) (or (= .cse48 .cse49) (let ((.cse51 (select |c_#memory_int| c_DUPFFnew_~ans~6.base))) (let ((.cse54 (select |c_old(#valid)| 0)) (.cse56 (select .cse51 c_DUPFFnew_~ans~6.offset)) (.cse50 (select |c_#valid| c_DUPFFnew_~ans~6.base)) (.cse53 (select |c_old(#valid)| c_DUPFFnew_~ans~6.base))) (and (= .cse50 (select .cse51 v_weq0_2)) (= .cse48 (select .cse52 c_DUPFFnew_~ans~6.offset)) (= v_weq0_2 .cse53) (= .cse54 v_weq0_2) (= (select .cse55 c_DUPFFnew_~ans~6.offset) .cse49) (= c_DUPFFnew_~ans~6.offset .cse54) (= 1 .cse56) (= .cse56 .cse50) (= .cse53 (select |c_#valid| 0)) (= 0 c_DUPFFnew_~ans~6.offset) (not (= c_DUPFFnew_~ans~6.base 0))))) (not (= v_weq0_2 (+ c_DUPFFnew_~ans~6.offset 8))))))) (= .cse22 (select |c_#valid| c_DUPFFnew_~ans~6.base)) (= .cse20 (select |c_#valid| 0)) (not (= |c_#valid| |c_old(#valid)|))))) is different from false [2018-01-21 10:10:21,446 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 10:10:21,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 10:10:21,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [5] total 20 [2018-01-21 10:10:21,447 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:10:21,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-21 10:10:21,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-21 10:10:21,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=160, Unknown=3, NotChecked=54, Total=272 [2018-01-21 10:10:21,448 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 17 states. Received shutdown request... [2018-01-21 10:10:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-21 10:10:31,125 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,130 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,130 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,130 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,130 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,130 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,131 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,131 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,131 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:10:31,131 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,133 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,134 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,134 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,134 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,134 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,134 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,135 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,135 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,135 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFcopyErr0EnsuresViolation======== [2018-01-21 10:10:31,135 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,136 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,137 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,137 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,138 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,138 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,138 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,138 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,138 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,138 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFswapErr0EnsuresViolation======== [2018-01-21 10:10:31,138 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,140 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,141 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,141 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,141 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,141 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,141 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,141 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,141 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,141 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFshift_addErr0EnsuresViolation======== [2018-01-21 10:10:31,141 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,143 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,144 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,144 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,144 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,144 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,144 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,145 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,145 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,145 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFdegErr0EnsuresViolation======== [2018-01-21 10:10:31,145 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,146 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,147 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,147 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,147 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,148 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,148 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,148 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,148 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,148 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:10:31,148 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,149 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,150 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,150 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,151 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,151 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,151 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,151 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,151 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,151 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == DUPFFfreeErr0EnsuresViolation======== [2018-01-21 10:10:31,151 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,153 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,153 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,153 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,154 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,154 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,154 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,154 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,154 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,154 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:10:31,154 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,156 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,156 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:10:31,157 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:10:31,157 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:10:31,157 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:10:31,157 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:10:31,157 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:10:31,157 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:10:31,157 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == FFmulErr0EnsuresViolation======== [2018-01-21 10:10:31,157 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:10:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-21 10:10:31,159 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:10:31,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:10:31 BoogieIcfgContainer [2018-01-21 10:10:31,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:10:31,161 INFO L168 Benchmark]: Toolchain (without parser) took 41952.13 ms. Allocated memory was 301.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 258.8 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 186.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:10:31,161 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 301.5 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:10:31,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.76 ms. Allocated memory is still 301.5 MB. Free memory was 258.8 MB in the beginning and 244.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:10:31,162 INFO L168 Benchmark]: Boogie Preprocessor took 52.88 ms. Allocated memory is still 301.5 MB. Free memory was 244.8 MB in the beginning and 242.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:10:31,162 INFO L168 Benchmark]: RCFGBuilder took 561.89 ms. Allocated memory is still 301.5 MB. Free memory was 242.8 MB in the beginning and 202.4 MB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 5.3 GB. [2018-01-21 10:10:31,162 INFO L168 Benchmark]: TraceAbstraction took 41074.01 ms. Allocated memory was 301.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 201.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 129.5 MB. Max. memory is 5.3 GB. [2018-01-21 10:10:31,164 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 301.5 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 255.76 ms. Allocated memory is still 301.5 MB. Free memory was 258.8 MB in the beginning and 244.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.88 ms. Allocated memory is still 301.5 MB. Free memory was 244.8 MB in the beginning and 242.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 561.89 ms. Allocated memory is still 301.5 MB. Free memory was 242.8 MB in the beginning and 202.4 MB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41074.01 ms. Allocated memory was 301.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 201.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 129.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 16 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 336 LocStat_NO_SUPPORTING_DISEQUALITIES : 105 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 80 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 69.626355 RENAME_VARIABLES(MILLISECONDS) : 7.454841 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 69.557497 PROJECTAWAY(MILLISECONDS) : 0.547776 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.045136 DISJOIN(MILLISECONDS) : 0.958399 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 7.509667 ADD_EQUALITY(MILLISECONDS) : 0.019738 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009340 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 116 #UNFREEZE : 0 #CONJOIN : 154 #PROJECTAWAY : 107 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 116 #ADD_EQUALITY : 101 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 16 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 187 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 25 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 4 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.246423 RENAME_VARIABLES(MILLISECONDS) : 77.447775 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.180433 PROJECTAWAY(MILLISECONDS) : 0.023059 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055854 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 77.508303 ADD_EQUALITY(MILLISECONDS) : 0.030512 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007802 #CONJOIN_DISJUNCTIVE : 34 #RENAME_VARIABLES : 47 #UNFREEZE : 0 #CONJOIN : 80 #PROJECTAWAY : 47 #ADD_WEAK_EQUALITY : 25 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 47 #ADD_EQUALITY : 68 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * 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 free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; 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: - CounterExampleResult [Line: 973]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1047] DUPFF f, g, cf, cg, h; VAL [f={16:0}, g={17:0}] [L1048] CALL DUPFFnew(1) VAL [\old(maxdeg)=1] [L975] EXPR, FCALL malloc(sizeof(struct DUPFFstruct)) VAL [\old(maxdeg)=1, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L975] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); VAL [\old(maxdeg)=1, ans={14:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L976] FCALL ans->coeffs = 0 VAL [\old(maxdeg)=1, ans={14:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L977] COND TRUE maxdeg >= 0 VAL [\old(maxdeg)=1, ans={14:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L978] EXPR, FCALL malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L978] FCALL ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L979] EXPR, FCALL ans->coeffs VAL [\old(maxdeg)=1, ans={14:0}, ans->coeffs={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L979] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={14:0}, ans->coeffs={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1, memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem))={24:0}] [L981] FCALL ans->maxdeg = maxdeg VAL [\old(maxdeg)=1, ans={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L982] FCALL ans->deg = -1 VAL [\old(maxdeg)=1, ans={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] [L983] return ans; VAL [\old(maxdeg)=1, \result={14:0}, ans={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={24:0}, malloc(sizeof(struct DUPFFstruct))={14:0}, maxdeg=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFnewErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. UNSAFE Result, 22.1s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 959 SDtfs, 424 SDslu, 6860 SDs, 0 SdLazy, 808 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1023 GetRequests, 791 SyntacticMatches, 51 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 14.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1130 ConstructedInterpolants, 72 QuantifiedInterpolants, 110820 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2114 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 37 InterpolantComputations, 2 PerfectInterpolantSequences, 0/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (165states) and interpolant automaton (currently 13 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (141 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFexgcdErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 18.8s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 70 SDslu, 154 SDs, 0 SdLazy, 234 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9768631170416884 AbsIntWeakeningRatio, 1.6 AbsIntAvgWeakeningVarsNumRemoved, 2.5 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 7910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 0 PerfectInterpolantSequences, 16/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 991). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFcopyErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFswapErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 995). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFshift_addErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 969]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 969). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFdegErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 985]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 985). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: DUPFFfreeErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1045). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 958]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 958). Cancelled while IsEmpty was searching accepting run (input had 165 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: FFmulErr0EnsuresViolation CFG has 12 procedures, 165 locations, 11 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred 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: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-21_10-10-31-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-21_10-10-31-176.csv Completed graceful shutdown