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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:24:46,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:24:46,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:24:46,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:24:46,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:24:46,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:24:46,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:24:46,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:24:46,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:24:46,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:24:46,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:24:46,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:24:46,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:24:46,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:24:46,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:24:46,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:24:46,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:24:46,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:24:46,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:24:46,746 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:24:46,748 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:24:46,748 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:24:46,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:24:46,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:24:46,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:24:46,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:24:46,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:24:46,753 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:24:46,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:24:46,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:24:46,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:24:46,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:24:46,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:24:46,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:24:46,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:24:46,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:24:46,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:24:46,765 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:24:46,765 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:24:46,765 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:24:46,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:24:46,766 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:24:46,766 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:24:46,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:24:46,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:24:46,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:24:46,767 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:24:46,767 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:24:46,768 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:24:46,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:24:46,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:24:46,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:24:46,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:24:46,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:24:46,769 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:24:46,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:24:46,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:24:46,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:24:46,770 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:24:46,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:24:46,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:24:46,770 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:24:46,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:24:46,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:24:46,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:24:46,771 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:24:46,772 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:24:46,772 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:24:46,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:24:46,821 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:24:46,825 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:24:46,827 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:24:46,828 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:24:46,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:24:47,011 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:24:47,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:24:47,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:24:47,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:24:47,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:24:47,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f336ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47, skipping insertion in model container [2018-01-25 05:24:47,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,049 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:24:47,088 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:24:47,223 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:24:47,243 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:24:47,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47 WrapperNode [2018-01-25 05:24:47,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:24:47,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:24:47,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:24:47,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:24:47,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (1/1) ... [2018-01-25 05:24:47,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:24:47,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:24:47,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:24:47,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:24:47,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (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-25 05:24:47,338 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:24:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:24:47,339 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:24:47,339 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:24:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:24:47,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:24:47,552 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:24:47,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:24:47 BoogieIcfgContainer [2018-01-25 05:24:47,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:24:47,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:24:47,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:24:47,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:24:47,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:24:47" (1/3) ... [2018-01-25 05:24:47,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f50a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:24:47, skipping insertion in model container [2018-01-25 05:24:47,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:24:47" (2/3) ... [2018-01-25 05:24:47,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f50a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:24:47, skipping insertion in model container [2018-01-25 05:24:47,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:24:47" (3/3) ... [2018-01-25 05:24:47,558 INFO L105 eAbstractionObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:24:47,565 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:24:47,570 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 05:24:47,609 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:24:47,610 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:24:47,610 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:24:47,610 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:24:47,610 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:24:47,610 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:24:47,610 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:24:47,611 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:24:47,612 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:24:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 05:24:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:24:47,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:47,641 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:47,642 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:24:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash 83465695, now seen corresponding path program 1 times [2018-01-25 05:24:47,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:47,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:47,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:47,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:47,698 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:47,744 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-25 05:24:47,744 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-25 05:24:47,744 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-25 05:24:47,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:47,755 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-25 05:24:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:47,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-01-25 05:24:47,805 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:24:47,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:47,805 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:24:47,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:47,811 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:47,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:47,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:24:47,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:47,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:47,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:24:47,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:24:47,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:47,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:24:47,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-25 05:24:47,978 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-25 05:24:47,979 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:48,003 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-25 05:24:48,032 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:48,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-01-25 05:24:48,032 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:48,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:24:48,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:24:48,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:24:48,111 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-01-25 05:24:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:48,214 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-01-25 05:24:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:24:48,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-25 05:24:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:48,229 INFO L225 Difference]: With dead ends: 66 [2018-01-25 05:24:48,229 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:24:48,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:24:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:24:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 05:24:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:24:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 05:24:48,275 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2018-01-25 05:24:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:48,276 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 05:24:48,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:24:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 05:24:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:24:48,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:48,277 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:48,277 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:24:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash 83465696, now seen corresponding path program 1 times [2018-01-25 05:24:48,278 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:48,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:48,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:48,288 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-25 05:24:48,289 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-25 05:24:48,289 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-25 05:24:48,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,300 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-25 05:24:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:48,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-01-25 05:24:48,345 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:24:48,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:48,346 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:24:48,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:48,353 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:48,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:48,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:24:48,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:24:48,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:24:48,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:48,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-25 05:24:48,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:48,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:48,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:24:48,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:24:48,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-01-25 05:24:48,593 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-25 05:24:48,593 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 05:24:48,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-25 05:24:48,807 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:24:48,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 05:24:48,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:48,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2018-01-25 05:24:48,852 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-25 05:24:48,884 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:48,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2018-01-25 05:24:48,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:48,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:24:48,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:24:48,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:24:48,886 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-25 05:24:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:49,210 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-25 05:24:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:24:49,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-25 05:24:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:49,212 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:24:49,212 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:24:49,213 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:24:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:24:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-01-25 05:24:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:24:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 05:24:49,219 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-01-25 05:24:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:49,219 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 05:24:49,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:24:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 05:24:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:24:49,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:49,220 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-25 05:24:49,220 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:24:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1544748661, now seen corresponding path program 1 times [2018-01-25 05:24:49,221 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:49,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:49,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:49,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:49,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:49,230 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-25 05:24:49,230 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-25 05:24:49,230 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-25 05:24:49,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:49,236 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-25 05:24:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:49,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-01-25 05:24:49,264 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:24:49,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:49,264 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:24:49,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:49,270 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:49,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:49,304 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-25 05:24:49,305 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:49,313 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-25 05:24:49,334 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:49,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-01-25 05:24:49,334 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:49,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:24:49,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:24:49,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:24:49,335 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-25 05:24:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:49,414 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-25 05:24:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:24:49,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 05:24:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:49,416 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:24:49,416 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:24:49,417 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:24:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:24:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-25 05:24:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:24:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-25 05:24:49,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-25 05:24:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:49,426 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-25 05:24:49,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:24:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-25 05:24:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:24:49,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:49,427 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:49,427 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:24:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash -301838139, now seen corresponding path program 1 times [2018-01-25 05:24:49,427 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:49,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:49,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:49,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:49,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:49,436 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-25 05:24:49,436 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-25 05:24:49,436 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-25 05:24:49,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:49,447 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-25 05:24:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:49,479 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 05:24:49,481 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [17], [19], [20], [21], [22], [30], [34], [39], [40], [42], [43], [45], [78], [79], [80] [2018-01-25 05:24:49,531 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:24:49,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:24:50,815 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:24:50,816 INFO L268 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 05:24:50,824 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:24:50,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:50,825 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:24:50,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:50,834 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:50,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:50,886 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:50,948 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:24:50,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-01-25 05:24:50,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:24:50,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:24:50,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:24:50,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:24:50,950 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-25 05:24:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:24:51,055 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-01-25 05:24:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:24:51,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 05:24:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:24:51,056 INFO L225 Difference]: With dead ends: 94 [2018-01-25 05:24:51,057 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 05:24:51,057 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:24:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 05:24:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-01-25 05:24:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:24:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-25 05:24:51,067 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 22 [2018-01-25 05:24:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:24:51,067 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-25 05:24:51,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:24:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-25 05:24:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:24:51,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:24:51,069 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:24:51,069 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:24:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1322906493, now seen corresponding path program 1 times [2018-01-25 05:24:51,069 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:24:51,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:51,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:51,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:24:51,071 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:24:51,079 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-25 05:24:51,079 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-25 05:24:51,079 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-25 05:24:51,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:51,089 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-25 05:24:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:51,134 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 05:24:51,134 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [17], [19], [20], [21], [22], [30], [34], [39], [40], [42], [43], [45], [78], [79], [80] [2018-01-25 05:24:51,135 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:24:51,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:24:52,139 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:24:52,140 INFO L268 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 05:24:52,150 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:24:52,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:52,151 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:24:52,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:52,162 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:24:52,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:24:52,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:24:52,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:52,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:24:52,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:52,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:24:52,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:24:52,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:52,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:24:52,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:24:52,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:52,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-25 05:24:52,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:24:52,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:24:52,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2018-01-25 05:24:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:24:52,408 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:24:54,613 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-25 05:24:56,793 WARN L143 SmtUtils]: Spent 2114ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-25 05:24:56,807 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-25 05:24:56,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:24:56,828 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 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 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:24:56,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:24:56,832 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:24:56,911 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-25 05:24:56,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-25 05:24:56,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-01-25 05:24:56,912 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:24:56,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:24:56,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:24:56,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:24:56,913 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 14 states. [2018-01-25 05:24:58,105 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-01-25 05:25:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:25:01,330 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-25 05:25:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:25:01,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-01-25 05:25:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:25:01,331 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:25:01,331 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:25:01,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:25:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:25:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-25 05:25:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:25:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-25 05:25:01,340 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 22 [2018-01-25 05:25:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:25:01,340 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-25 05:25:01,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:25:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-25 05:25:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:25:01,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:25:01,341 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] [2018-01-25 05:25:01,342 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:25:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1599933162, now seen corresponding path program 1 times [2018-01-25 05:25:01,342 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:25:01,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:01,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:01,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:25:01,343 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:25:01,349 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-25 05:25:01,349 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-25 05:25:01,349 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-25 05:25:01,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:01,356 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-25 05:25:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:01,382 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:25:01,383 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [17], [19], [20], [21], [22], [30], [34], [37], [39], [40], [43], [45], [49], [53], [58], [61], [78], [79], [80] [2018-01-25 05:25:01,384 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:25:01,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:25:02,542 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:25:02,542 INFO L268 AbstractInterpreter]: Visited 24 different actions 34 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 05:25:02,547 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:25:02,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:25:02,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 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-25 05:25:02,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:25:02,559 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:25:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:25:02,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:25:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:25:02,700 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:25:02,892 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 64 DAG size of output 38 [2018-01-25 05:25:04,915 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse4 (<= 0 c_main_~length~2)) (.cse3 (< c_main_~length~2 0))) (and (forall ((v_main_~i~2_26 Int)) (let ((.cse2 (mod v_main_~i~2_26 c_main_~length~2))) (let ((.cse1 (* 4 c_main_~length~2)) (.cse0 (* 4 .cse2))) (or (< v_main_~i~2_26 (+ c_main_~i~2 1)) (<= 0 (+ .cse0 c_main_~arr~2.offset .cse1)) (<= 0 v_main_~i~2_26) (<= .cse1 (+ .cse0 c_main_~arr~2.offset)) (= .cse2 0))))) (or .cse3 (forall ((v_prenex_9 Int)) (or (< v_prenex_9 (+ c_main_~i~2 1)) (<= 0 v_prenex_9) (= (mod v_prenex_9 c_main_~length~2) 0))) .cse4) (forall ((v_prenex_8 Int)) (let ((.cse8 (* 4 (mod v_prenex_8 c_main_~length~2)))) (let ((.cse5 (+ .cse8 c_main_~arr~2.offset 4)) (.cse7 (* 4 c_main_~length~2)) (.cse6 (select |c_#length| c_main_~arr~2.base))) (or (<= .cse5 (+ .cse6 .cse7)) (< v_prenex_8 (+ c_main_~i~2 1)) (<= .cse5 .cse6) (<= (+ .cse8 c_main_~arr~2.offset .cse7 4) .cse6))))) (or .cse4 (forall ((v_prenex_10 Int)) (let ((.cse9 (mod v_prenex_10 c_main_~length~2))) (or (< v_prenex_10 (+ c_main_~i~2 1)) (<= 0 v_prenex_10) (= .cse9 0) (<= 0 (+ c_main_~arr~2.offset (* 4 c_main_~length~2) (* 4 .cse9))))))) (forall ((v_prenex_12 Int)) (let ((.cse10 (* 4 (mod v_prenex_12 c_main_~length~2)))) (let ((.cse11 (* 4 c_main_~length~2)) (.cse12 (+ c_main_~arr~2.offset .cse10))) (or (<= 0 (+ c_main_~arr~2.offset .cse10 .cse11)) (<= .cse11 .cse12) (<= 0 .cse12) (< v_prenex_12 (+ c_main_~i~2 1)))))) (or (forall ((v_prenex_13 Int)) (let ((.cse13 (* 4 (mod v_prenex_13 c_main_~length~2)))) (or (<= 0 (+ .cse13 c_main_~arr~2.offset)) (< v_prenex_13 (+ c_main_~i~2 1)) (<= 0 (+ .cse13 c_main_~arr~2.offset (* 4 c_main_~length~2)))))) .cse4) (or .cse3 (forall ((v_prenex_6 Int)) (let ((.cse14 (+ (* 4 (mod v_prenex_6 c_main_~length~2)) c_main_~arr~2.offset))) (or (<= (* 4 c_main_~length~2) .cse14) (< v_prenex_6 (+ c_main_~i~2 1)) (<= 0 .cse14))))) (or .cse3 (forall ((v_prenex_5 Int)) (or (< v_prenex_5 (+ c_main_~i~2 1)) (<= 0 (+ c_main_~arr~2.offset (* 4 (mod v_prenex_5 c_main_~length~2)))))) .cse4) (forall ((v_prenex_14 Int)) (or (< v_prenex_14 (+ c_main_~i~2 1)) (<= (+ c_main_~arr~2.offset (* 4 (mod v_prenex_14 c_main_~length~2)) 4) (select |c_#length| c_main_~arr~2.base)) (< v_prenex_14 0))) (forall ((v_prenex_11 Int)) (let ((.cse15 (mod v_prenex_11 c_main_~length~2))) (or (<= (+ c_main_~arr~2.offset (* 4 .cse15) 4) (select |c_#length| c_main_~arr~2.base)) (< v_prenex_11 (+ c_main_~i~2 1)) (not (= .cse15 0))))) (or .cse3 (forall ((v_prenex_7 Int)) (let ((.cse16 (mod v_prenex_7 c_main_~length~2))) (or (<= 0 v_prenex_7) (= .cse16 0) (< v_prenex_7 (+ c_main_~i~2 1)) (<= (* 4 c_main_~length~2) (+ (* 4 .cse16) c_main_~arr~2.offset)))))))) is different from false [2018-01-25 05:25:04,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-25 05:25:04,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:05,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-25 05:25:05,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:05,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-25 05:25:05,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:07,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-01-25 05:25:07,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:07,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-25 05:25:07,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:08,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-25 05:25:08,523 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:08,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-01-25 05:25:08,937 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:09,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-25 05:25:09,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:09,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-25 05:25:09,502 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-25 05:25:10,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 11 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-25 05:25:10,186 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 33 variables, input treesize:448, output treesize:238 [2018-01-25 05:25:12,190 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse10 (<= 0 c_main_~length~2)) (.cse3 (< c_main_~length~2 0))) (and (forall ((v_main_~i~2_26 Int)) (let ((.cse2 (mod v_main_~i~2_26 c_main_~length~2))) (let ((.cse1 (* 4 c_main_~length~2)) (.cse0 (* 4 .cse2))) (or (< v_main_~i~2_26 (+ c_main_~i~2 1)) (<= 0 (+ .cse0 c_main_~arr~2.offset .cse1)) (<= 0 v_main_~i~2_26) (<= .cse1 (+ .cse0 c_main_~arr~2.offset)) (= .cse2 0))))) (or .cse3 (forall ((v_prenex_6 Int)) (or (< v_prenex_6 (+ c_main_~i~2 1)) (<= 0 (+ (* 4 (mod v_prenex_6 c_main_~length~2)) c_main_~arr~2.offset))))) (forall ((v_prenex_12 Int)) (let ((.cse5 (* 4 c_main_~length~2)) (.cse4 (* 4 (mod v_prenex_12 c_main_~length~2)))) (or (<= 0 (+ c_main_~arr~2.offset .cse4 .cse5)) (<= .cse5 (+ c_main_~arr~2.offset .cse4)) (< v_prenex_12 (+ c_main_~i~2 1))))) (forall ((v_prenex_8 Int)) (let ((.cse6 (* 4 (mod v_prenex_8 c_main_~length~2))) (.cse8 (* 4 c_main_~i~2)) (.cse7 (* 4 c_main_~length~2))) (or (< v_prenex_8 (+ c_main_~i~2 1)) (< (+ .cse6 .cse7) (+ .cse8 1)) (< .cse6 (+ .cse8 .cse7 1))))) (forall ((v_prenex_14 Int)) (or (< v_prenex_14 (+ c_main_~i~2 1)) (< v_prenex_14 0) (< (* 4 (mod v_prenex_14 c_main_~length~2)) (+ (* 4 c_main_~i~2) 1)))) (forall ((v_prenex_11 Int)) (let ((.cse9 (mod v_prenex_11 c_main_~length~2))) (or (< v_prenex_11 (+ c_main_~i~2 1)) (not (= .cse9 0)) (< (* 4 .cse9) (+ (* 4 c_main_~i~2) 1))))) (or .cse10 (forall ((v_prenex_10 Int)) (let ((.cse11 (mod v_prenex_10 c_main_~length~2))) (or (< v_prenex_10 (+ c_main_~i~2 1)) (<= 0 v_prenex_10) (= .cse11 0) (<= 0 (+ c_main_~arr~2.offset (* 4 c_main_~length~2) (* 4 .cse11))))))) (or (forall ((v_prenex_13 Int)) (or (<= 0 (+ (* 4 (mod v_prenex_13 c_main_~length~2)) c_main_~arr~2.offset)) (< v_prenex_13 (+ c_main_~i~2 1)))) .cse10) (or .cse3 (forall ((v_prenex_7 Int)) (let ((.cse12 (mod v_prenex_7 c_main_~length~2))) (or (<= 0 v_prenex_7) (= .cse12 0) (< v_prenex_7 (+ c_main_~i~2 1)) (<= (* 4 c_main_~length~2) (+ (* 4 .cse12) c_main_~arr~2.offset)))))))) is different from false [2018-01-25 05:25:38,043 WARN L146 SmtUtils]: Spent 11727ms on a formula simplification. DAG size of input: 113 DAG size of output 43 [2018-01-25 05:25:51,419 WARN L143 SmtUtils]: Spent 5338ms on a formula simplification that was a NOOP. DAG size: 43 Received shutdown request... [2018-01-25 05:25:59,516 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:25:59,516 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:25:59,519 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:25:59,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:25:59 BoogieIcfgContainer [2018-01-25 05:25:59,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:25:59,521 INFO L168 Benchmark]: Toolchain (without parser) took 72509.24 ms. Allocated memory was 306.2 MB in the beginning and 704.6 MB in the end (delta: 398.5 MB). Free memory was 264.5 MB in the beginning and 350.7 MB in the end (delta: -86.2 MB). Peak memory consumption was 312.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:59,521 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:25:59,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.95 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:59,522 INFO L168 Benchmark]: Boogie Preprocessor took 39.77 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:59,522 INFO L168 Benchmark]: RCFGBuilder took 260.62 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 234.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:59,522 INFO L168 Benchmark]: TraceAbstraction took 71966.71 ms. Allocated memory was 306.2 MB in the beginning and 704.6 MB in the end (delta: 398.5 MB). Free memory was 234.8 MB in the beginning and 350.7 MB in the end (delta: -115.9 MB). Peak memory consumption was 282.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:25:59,523 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.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.95 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.77 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 260.62 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 234.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71966.71 ms. Allocated memory was 306.2 MB in the beginning and 704.6 MB in the end (delta: 398.5 MB). Free memory was 234.8 MB in the beginning and 350.7 MB in the end (delta: -115.9 MB). Peak memory consumption was 282.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 11.345542 RENAME_VARIABLES(MILLISECONDS) : 5.766214 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 11.199606 PROJECTAWAY(MILLISECONDS) : 10.878891 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.193197 DISJOIN(MILLISECONDS) : 4.434478 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 5.852817 ADD_EQUALITY(MILLISECONDS) : 0.115976 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013079 #CONJOIN_DISJUNCTIVE : 46 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 84 #PROJECTAWAY : 64 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 67 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 235 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 10.083101 RENAME_VARIABLES(MILLISECONDS) : 5.348458 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 9.993402 PROJECTAWAY(MILLISECONDS) : 9.997075 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067271 DISJOIN(MILLISECONDS) : 4.339522 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 5.420641 ADD_EQUALITY(MILLISECONDS) : 0.043725 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007183 #CONJOIN_DISJUNCTIVE : 46 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 84 #PROJECTAWAY : 64 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 67 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 307 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 18.018674 RENAME_VARIABLES(MILLISECONDS) : 4.490452 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 9.060588 PROJECTAWAY(MILLISECONDS) : 0.316528 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.079669 DISJOIN(MILLISECONDS) : 3.534916 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 4.542311 ADD_EQUALITY(MILLISECONDS) : 0.023559 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007656 #CONJOIN_DISJUNCTIVE : 58 #RENAME_VARIABLES : 97 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 41 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 42. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 7 error locations. TIMEOUT Result, 71.9s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 430 SDslu, 223 SDs, 0 SdLazy, 261 SolverSat, 36 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 184 ConstructedInterpolants, 26 QuantifiedInterpolants, 27667 SizeOfPredicates, 29 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-25-59-536.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-25-59-536.csv Completed graceful shutdown