java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:01:23,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:01:23,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:01:23,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:01:23,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:01:23,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:01:23,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:01:23,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:01:23,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:01:23,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:01:23,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:01:23,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:01:23,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:01:23,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:01:23,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:01:23,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:01:23,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:01:23,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:01:23,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:01:23,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:01:23,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:01:23,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:01:23,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:01:23,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:01:23,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:01:23,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:01:23,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:01:23,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:01:23,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:01:23,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:01:23,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:01:23,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:01:23,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:01:23,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:01:23,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:01:23,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:01:23,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:01:23,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:01:23,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:01:23,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:01:23,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:01:23,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:01:23,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:01:23,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:01:23,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:01:23,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:01:23,300 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:01:23,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:01:23,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:01:23,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:01:23,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:01:23,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:01:23,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:01:23,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:01:23,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:01:23,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:01:23,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:01:23,303 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:01:23,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:01:23,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:01:23,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:01:23,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:01:23,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:01:23,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:01:23,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:01:23,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:01:23,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:01:23,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:01:23,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:01:23,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:01:23,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:01:23,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:01:23,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:01:23,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:01:23,646 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:01:23,646 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:01:23,647 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-15 03:01:23,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921eb3758/5f5a33dee1c04351a975511ae0951680/FLAG6e15001da [2019-10-15 03:01:24,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:01:24,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-15 03:01:24,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921eb3758/5f5a33dee1c04351a975511ae0951680/FLAG6e15001da [2019-10-15 03:01:24,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921eb3758/5f5a33dee1c04351a975511ae0951680 [2019-10-15 03:01:24,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:01:24,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:01:24,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:24,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:01:24,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:01:24,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799252b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:24, skipping insertion in model container [2019-10-15 03:01:24,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:24" (1/1) ... [2019-10-15 03:01:24,547 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:01:24,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:01:24,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:24,833 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:01:25,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:25,046 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:01:25,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25 WrapperNode [2019-10-15 03:01:25,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:25,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:01:25,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:01:25,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:01:25,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... [2019-10-15 03:01:25,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:01:25,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:01:25,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:01:25,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:01:25,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-15 03:01:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:01:25,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:01:25,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:01:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:01:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:01:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:01:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-15 03:01:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:01:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:01:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:01:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:01:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:01:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:01:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:01:25,595 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:01:25,596 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:01:25,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:25 BoogieIcfgContainer [2019-10-15 03:01:25,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:01:25,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:01:25,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:01:25,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:01:25,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:01:24" (1/3) ... [2019-10-15 03:01:25,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd583c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:25, skipping insertion in model container [2019-10-15 03:01:25,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:25" (2/3) ... [2019-10-15 03:01:25,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd583c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:25, skipping insertion in model container [2019-10-15 03:01:25,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:25" (3/3) ... [2019-10-15 03:01:25,606 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-15 03:01:25,616 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:01:25,624 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-15 03:01:25,634 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-15 03:01:25,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:01:25,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:01:25,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:01:25,661 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:01:25,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:01:25,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:01:25,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:01:25,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:01:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-15 03:01:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:01:25,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:25,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:25,690 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2043100231, now seen corresponding path program 1 times [2019-10-15 03:01:25,706 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:25,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338501679] [2019-10-15 03:01:25,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:25,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:25,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338501679] [2019-10-15 03:01:25,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:25,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:25,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709906121] [2019-10-15 03:01:25,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:25,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:25,919 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-15 03:01:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:25,972 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-10-15 03:01:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:25,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-15 03:01:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:25,987 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:01:25,988 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 03:01:25,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 03:01:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-15 03:01:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:01:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-15 03:01:26,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2019-10-15 03:01:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,038 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-15 03:01:26,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-15 03:01:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:01:26,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1071190840, now seen corresponding path program 1 times [2019-10-15 03:01:26,041 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487814491] [2019-10-15 03:01:26,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:26,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487814491] [2019-10-15 03:01:26,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:26,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:01:26,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874306903] [2019-10-15 03:01:26,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:01:26,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:26,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:01:26,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:01:26,105 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-10-15 03:01:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:26,158 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-15 03:01:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:01:26,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:01:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:26,160 INFO L225 Difference]: With dead ends: 52 [2019-10-15 03:01:26,161 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 03:01:26,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:01:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 03:01:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2019-10-15 03:01:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:01:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-15 03:01:26,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2019-10-15 03:01:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,172 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-15 03:01:26,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:01:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-15 03:01:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:01:26,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,173 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1006514579, now seen corresponding path program 1 times [2019-10-15 03:01:26,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004943673] [2019-10-15 03:01:26,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:26,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004943673] [2019-10-15 03:01:26,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:26,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:26,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490492600] [2019-10-15 03:01:26,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:26,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,229 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-10-15 03:01:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:26,285 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-15 03:01:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:26,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 03:01:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:26,288 INFO L225 Difference]: With dead ends: 61 [2019-10-15 03:01:26,288 INFO L226 Difference]: Without dead ends: 40 [2019-10-15 03:01:26,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-15 03:01:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-15 03:01:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:01:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-15 03:01:26,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2019-10-15 03:01:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,296 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-15 03:01:26,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-15 03:01:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:01:26,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1210971472, now seen corresponding path program 1 times [2019-10-15 03:01:26,299 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094289354] [2019-10-15 03:01:26,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:26,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094289354] [2019-10-15 03:01:26,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:26,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:01:26,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394640727] [2019-10-15 03:01:26,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:01:26,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:26,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:01:26,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,346 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-15 03:01:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:26,391 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-15 03:01:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:01:26,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 03:01:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:26,393 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:01:26,393 INFO L226 Difference]: Without dead ends: 34 [2019-10-15 03:01:26,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:01:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-15 03:01:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-10-15 03:01:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-15 03:01:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-15 03:01:26,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 14 [2019-10-15 03:01:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:26,400 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-15 03:01:26,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:01:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-15 03:01:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:01:26,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:26,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:26,401 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1694409031, now seen corresponding path program 1 times [2019-10-15 03:01:26,402 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:26,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150671203] [2019-10-15 03:01:26,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:26,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:26,982 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-10-15 03:01:27,488 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 89 [2019-10-15 03:01:27,867 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 73 [2019-10-15 03:01:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:27,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150671203] [2019-10-15 03:01:27,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:27,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:01:27,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708534531] [2019-10-15 03:01:27,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:01:27,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:27,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:01:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:01:27,892 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-10-15 03:01:28,114 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-10-15 03:01:28,295 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2019-10-15 03:01:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:28,354 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-15 03:01:28,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:01:28,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-15 03:01:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:28,358 INFO L225 Difference]: With dead ends: 46 [2019-10-15 03:01:28,359 INFO L226 Difference]: Without dead ends: 30 [2019-10-15 03:01:28,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:01:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-15 03:01:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-15 03:01:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:01:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-15 03:01:28,365 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 19 [2019-10-15 03:01:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:28,365 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-15 03:01:28,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:01:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-15 03:01:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:01:28,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:28,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:28,367 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash 336204734, now seen corresponding path program 1 times [2019-10-15 03:01:28,368 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:28,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127484118] [2019-10-15 03:01:28,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:28,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:28,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:28,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127484118] [2019-10-15 03:01:28,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:28,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:01:28,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111005197] [2019-10-15 03:01:28,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:01:28,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:01:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:01:28,427 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-10-15 03:01:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:28,497 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-15 03:01:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:01:28,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 03:01:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:28,501 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:01:28,501 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:01:28,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:01:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:01:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-10-15 03:01:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:01:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-15 03:01:28,514 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2019-10-15 03:01:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:28,514 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-15 03:01:28,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:01:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-15 03:01:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:01:28,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:28,518 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:28,519 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -608232998, now seen corresponding path program 1 times [2019-10-15 03:01:28,520 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:28,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211604251] [2019-10-15 03:01:28,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:28,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:28,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:28,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211604251] [2019-10-15 03:01:28,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694778589] [2019-10-15 03:01:28,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/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 [2019-10-15 03:01:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:28,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 03:01:28,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:01:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:29,126 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:01:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:31,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845091057] [2019-10-15 03:01:31,287 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-15 03:01:31,287 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:01:31,294 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:01:31,303 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:01:31,304 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:01:31,516 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 03:01:32,524 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2019-10-15 03:01:32,547 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:01:32,902 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-10-15 03:01:33,293 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-15 03:01:33,489 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-15 03:01:33,710 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-15 03:01:36,151 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-15 03:01:36,429 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-15 03:01:36,665 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-15 03:01:36,971 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-15 03:01:37,138 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2019-10-15 03:01:37,597 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-10-15 03:01:37,901 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-15 03:01:37,907 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:01:37,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 16] total 25 [2019-10-15 03:01:37,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800683493] [2019-10-15 03:01:37,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:01:37,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:37,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:01:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:01:37,915 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 25 states. [2019-10-15 03:01:44,289 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-15 03:01:44,843 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-15 03:01:48,461 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 72 [2019-10-15 03:01:50,629 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-10-15 03:02:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:01,134 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-15 03:02:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 03:02:01,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 22 [2019-10-15 03:02:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:01,136 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:02:01,136 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:02:01,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2019-10-15 03:02:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:02:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:02:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:02:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:02:01,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-15 03:02:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:01,139 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:02:01,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:02:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:02:01,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:02:01,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:01,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:02:01,841 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-10-15 03:02:04,021 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-10-15 03:02:04,150 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-15 03:02:04,411 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-10-15 03:02:04,413 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~__return_136~0)| ~__return_136~0) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-15 03:02:04,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:02:04,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:02:04,413 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~__tmp_155_0~0 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= ~__return_136~0 0)) [2019-10-15 03:02:04,414 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:02:04,414 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:02:04,414 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-10-15 03:02:04,414 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-10-15 03:02:04,414 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-10-15 03:02:04,414 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-10-15 03:02:04,414 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-10-15 03:02:04,414 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-10-15 03:02:04,415 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse8 (div main_~main__index1~0 4294967296)) (.cse7 (div main_~main__index2~0 4294967296))) (let ((.cse9 (= main_~__VERIFIER_assert__cond~0 1)) (.cse0 (* 4294967296 .cse7)) (.cse1 (+ (* 4294967296 .cse8) main_~main__index2~0))) (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (and (or (<= (+ main_~main__index1~0 .cse0) .cse1) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse6 (+ (* .cse8 (- 17179869184)) (* main_~main__index1~0 4) |main_~#main__array~0.offset|))) (.cse5 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse7 (- 17179869184)))))) (let ((.cse4 (* 4294967296 (div .cse5 4294967296))) (.cse2 (+ .cse5 (* 4294967296 (div .cse3 4294967296))))) (and (< .cse2 (+ .cse3 .cse4 1)) (<= (+ .cse3 .cse4) .cse2)))))) .cse9 (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (div (+ main_~main__index2~0 4294867297) 4294967296) (- 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (and (<= main_~main__index2~0 (+ .cse0 99999)) .cse9 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse0 1) .cse1)) (not (<= |old(~__tmp_155_0~0)| 0))))) [2019-10-15 03:02:04,415 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-10-15 03:02:04,415 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-10-15 03:02:04,415 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-10-15 03:02:04,415 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-10-15 03:02:04,416 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-15 03:02:04,416 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (div (+ main_~main__index2~0 4294867297) 4294967296) (- 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-15 03:02:04,416 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-10-15 03:02:04,416 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-10-15 03:02:04,416 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (let ((.cse4 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse1 (<= main_~main__index2~0 (+ .cse4 99999))) (.cse2 (= main_~__VERIFIER_assert__cond~0 1)) (.cse3 (<= (+ main_~main__index1~0 .cse4 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse3)))))) (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (div (+ main_~main__index2~0 4294867297) 4294967296) (- 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) .cse0) (not (<= |old(~__tmp_155_0~0)| 0)) (and (not (= 0 |main_~#main__array~0.base|)) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (= main_~main__loop_entered~0 0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= |main_~#main__array~0.offset| 0) (= ~__tmp_155_0~0 main_~main____CPAchecker_TMP_0~0) (= main_~__tmp_1~0 main_~main____CPAchecker_TMP_0~0) (< |main_~#main__array~0.base| |#StackHeapBarrier|) .cse0))) [2019-10-15 03:02:04,417 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-15 03:02:04,417 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-10-15 03:02:04,417 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-10-15 03:02:04,417 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-15 03:02:04,417 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-10-15 03:02:04,417 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-10-15 03:02:04,417 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (= main_~main__loop_entered~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (= |main_~#main__array~0.offset| 0) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (< |main_~#main__array~0.base| |#StackHeapBarrier|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-15 03:02:04,418 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-10-15 03:02:04,418 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-10-15 03:02:04,418 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-15 03:02:04,418 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (and (<= ~__tmp_155_0~0 0) (<= 0 ~__tmp_155_0~0) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-15 03:02:04,418 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-10-15 03:02:04,419 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-10-15 03:02:04,419 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-10-15 03:02:04,419 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-10-15 03:02:04,419 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-15 03:02:04,419 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (and (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (div (+ main_~main__index2~0 4294867297) 4294967296) (- 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (not (= main_~__VERIFIER_assert__cond~2 0))) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-15 03:02:04,419 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-15 03:02:04,420 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-10-15 03:02:04,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,438 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,438 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,439 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,440 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,440 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:02:04 BoogieIcfgContainer [2019-10-15 03:02:04,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:02:04,474 INFO L168 Benchmark]: Toolchain (without parser) took 39943.51 ms. Allocated memory was 135.8 MB in the beginning and 312.0 MB in the end (delta: 176.2 MB). Free memory was 99.4 MB in the beginning and 154.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 120.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:04,475 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-15 03:02:04,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.64 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 99.2 MB in the beginning and 179.9 MB in the end (delta: -80.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:04,477 INFO L168 Benchmark]: Boogie Preprocessor took 78.87 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:04,478 INFO L168 Benchmark]: RCFGBuilder took 470.19 ms. Allocated memory is still 201.3 MB. Free memory was 177.1 MB in the beginning and 156.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:04,479 INFO L168 Benchmark]: TraceAbstraction took 38874.07 ms. Allocated memory was 201.3 MB in the beginning and 312.0 MB in the end (delta: 110.6 MB). Free memory was 156.9 MB in the beginning and 154.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:04,483 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 515.64 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 99.2 MB in the beginning and 179.9 MB in the end (delta: -80.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.87 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 470.19 ms. Allocated memory is still 201.3 MB. Free memory was 177.1 MB in the beginning and 156.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38874.07 ms. Allocated memory was 201.3 MB in the beginning and 312.0 MB in the end (delta: 110.6 MB). Free memory was 156.9 MB in the beginning and 154.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2019-10-15 03:02:04,496 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,497 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,497 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,497 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || ((__VERIFIER_assert__cond == 1 && main__index1 <= 4294967296 * ((main__index1 + (main__index2 + 4294867297) / 4294967296 * -4294967296 + -1) / 4294967296) + main__index2 + 1) && !(__VERIFIER_assert__cond == 0))) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 55]: Loop Invariant [2019-10-15 03:02:04,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 24]: Loop Invariant [2019-10-15 03:02:04,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 93]: Loop Invariant [2019-10-15 03:02:04,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 03:02:04,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || (((main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 || (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] / 4294967296) < unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) + 1 && unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) <= unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] / 4294967296))) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index1 + (main__index2 + 4294867297) / 4294967296 * -4294967296 + -1) / 4294967296) + main__index2 + 1)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 57]: Loop Invariant [2019-10-15 03:02:04,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || (((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && main__index1 <= 4294967296 * ((main__index1 + (main__index2 + 4294867297) / 4294967296 * -4294967296 + -1) / 4294967296) + main__index2 + 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 26]: Loop Invariant [2019-10-15 03:02:04,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || ((((((((((__tmp_155_0 == \old(__tmp_155_0) && !(0 == main__array)) && \old(unknown-#length-unknown)[main__array := 400000] == unknown-#length-unknown) && \valid == \old(\valid)[main__array := 1]) && main__loop_entered == 0) && main__index2 % 4294967296 < 100000) && \old(\valid)[main__array] == 0) && 1 == main____CPAchecker_TMP_0) && main__array == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main__array < unknown-#StackHeapBarrier-unknown)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant [2019-10-15 03:02:04,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 03:02:04,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 03:02:04,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 03:02:04,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || (main__index1 <= 4294967296 * ((main__index1 + (main__index2 + 4294867297) / 4294967296 * -4294967296 + -1) / 4294967296) + main__index2 + 1 && ((((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)))) || !(\old(__tmp_155_0) <= 0)) || ((((((((((!(0 == main__array) && \old(unknown-#length-unknown)[main__array := 400000] == unknown-#length-unknown) && \valid == \old(\valid)[main__array := 1]) && main__loop_entered == 0) && __tmp_1 == __VERIFIER_assert__cond) && \old(\valid)[main__array] == 0) && main__array == 0) && __tmp_155_0 == main____CPAchecker_TMP_0) && __tmp_1 == main____CPAchecker_TMP_0) && main__array < unknown-#StackHeapBarrier-unknown) && ((((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 4 error locations. Result: SAFE, OverallTime: 38.7s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 197 SDtfs, 227 SDslu, 274 SDs, 0 SdLazy, 334 SolverSat, 25 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 24 NumberOfFragments, 874 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1713 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 254 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 50717 SizeOfPredicates, 3 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1260, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 33, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 24, TOOLS_POST_TIME[ms]: 114, TOOLS_POST_CALL_APPLICATIONS: 4, TOOLS_POST_CALL_TIME[ms]: 14, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME[ms]: 3, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME[ms]: 112, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 54, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 27, DOMAIN_JOIN_TIME[ms]: 993, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 30, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 11, DOMAIN_ISBOTTOM_APPLICATIONS: 2, DOMAIN_ISBOTTOM_TIME[ms]: 7, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 413, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 413, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME[ms]: 86, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 85, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 23, DAG_COMPRESSION_PROCESSED_NODES: 188, DAG_COMPRESSION_RETAINED_NODES: 59, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...