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/array-tiling/pnr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:38:07,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:38:07,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:38:07,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:38:07,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:38:07,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:38:07,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:38:07,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:38:07,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:38:07,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:38:07,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:38:07,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:38:07,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:38:07,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:38:07,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:38:07,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:38:07,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:38:07,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:38:07,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:38:07,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:38:07,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:38:07,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:38:07,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:38:07,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:38:07,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:38:07,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:38:07,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:38:07,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:38:07,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:38:07,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:38:07,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:38:07,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:38:07,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:38:07,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:38:07,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:38:07,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:38:07,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:38:07,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:38:07,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:38:07,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:38:07,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:38:07,720 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 01:38:07,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:38:07,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:38:07,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:38:07,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:38:07,742 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:38:07,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:38:07,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:38:07,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:38:07,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:38:07,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:38:07,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:38:07,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:38:07,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:38:07,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:38:07,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:38:07,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:38:07,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:38:07,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:38:07,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:38:07,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:38:07,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:38:07,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:38:07,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:38:07,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:38:07,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:38:07,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:38:07,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:38:07,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:38:07,747 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 01:38:08,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:38:08,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:38:08,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:38:08,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:38:08,063 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:38:08,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr2.c [2019-10-15 01:38:08,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9967694/a0ff9163d2504b0aaeb2430870b1963b/FLAGb3f855906 [2019-10-15 01:38:08,585 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:38:08,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr2.c [2019-10-15 01:38:08,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9967694/a0ff9163d2504b0aaeb2430870b1963b/FLAGb3f855906 [2019-10-15 01:38:09,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9967694/a0ff9163d2504b0aaeb2430870b1963b [2019-10-15 01:38:09,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:38:09,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:38:09,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:38:09,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:38:09,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:38:09,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7492c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09, skipping insertion in model container [2019-10-15 01:38:09,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,039 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:38:09,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:38:09,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:38:09,303 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:38:09,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:38:09,341 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:38:09,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09 WrapperNode [2019-10-15 01:38:09,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:38:09,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:38:09,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:38:09,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:38:09,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (1/1) ... [2019-10-15 01:38:09,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:38:09,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:38:09,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:38:09,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:38:09,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (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 01:38:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:38:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:38:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:38:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-10-15 01:38:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:38:09,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:38:09,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:38:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:38:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:38:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:38:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-10-15 01:38:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:38:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:38:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:38:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:38:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:38:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:38:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:38:09,905 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:38:09,905 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:38:09,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:38:09 BoogieIcfgContainer [2019-10-15 01:38:09,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:38:09,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:38:09,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:38:09,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:38:09,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:38:09" (1/3) ... [2019-10-15 01:38:09,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab79dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:38:09, skipping insertion in model container [2019-10-15 01:38:09,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:38:09" (2/3) ... [2019-10-15 01:38:09,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab79dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:38:09, skipping insertion in model container [2019-10-15 01:38:09,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:38:09" (3/3) ... [2019-10-15 01:38:09,914 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr2.c [2019-10-15 01:38:09,925 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:38:09,932 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:38:09,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:38:09,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:38:09,968 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:38:09,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:38:09,968 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:38:09,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:38:09,968 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:38:09,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:38:09,969 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:38:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-15 01:38:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:38:09,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:38:09,989 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:38:09,991 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:38:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:38:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash 280957092, now seen corresponding path program 1 times [2019-10-15 01:38:10,001 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:38:10,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008690293] [2019-10-15 01:38:10,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:38:10,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:38:10,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:38:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:38:10,219 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 01:38:10,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008690293] [2019-10-15 01:38:10,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:38:10,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:38:10,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302372858] [2019-10-15 01:38:10,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:38:10,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:38:10,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:38:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:38:10,241 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2019-10-15 01:38:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:38:10,384 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-10-15 01:38:10,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:38:10,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 01:38:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:38:10,397 INFO L225 Difference]: With dead ends: 52 [2019-10-15 01:38:10,398 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 01:38:10,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:38:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 01:38:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-10-15 01:38:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 01:38:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-15 01:38:10,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2019-10-15 01:38:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:38:10,452 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-15 01:38:10,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:38:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-15 01:38:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:38:10,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:38:10,454 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 01:38:10,455 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:38:10,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:38:10,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1701880019, now seen corresponding path program 1 times [2019-10-15 01:38:10,456 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:38:10,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345598862] [2019-10-15 01:38:10,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:38:10,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:38:10,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:38:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:38:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:38:11,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345598862] [2019-10-15 01:38:11,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760827586] [2019-10-15 01:38:11,119 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 01:38:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:38:11,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 01:38:11,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:38:11,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-10-15 01:38:11,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:38:11,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:38:11,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-10-15 01:38:11,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:38:11,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:38:11,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-15 01:38:11,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2019-10-15 01:38:11,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:38:11,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:38:11,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-15 01:38:11,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:38:11,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:38:11,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-10-15 01:38:11,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:38:11,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:38:11,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-15 01:38:11,542 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:44 [2019-10-15 01:38:11,617 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-15 01:38:11,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2019-10-15 01:38:11,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:38:11,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:38:11,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:38:11,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:8 [2019-10-15 01:38:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:38:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:38:11,692 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:38:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:38:11,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:38:11,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-10-15 01:38:11,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-10-15 01:38:11,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-15 01:38:11,833 INFO L567 ElimStorePlain]: treesize reduction 10, result has 56.5 percent of original size [2019-10-15 01:38:11,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-15 01:38:11,844 INFO L567 ElimStorePlain]: treesize reduction 20, result has 39.4 percent of original size [2019-10-15 01:38:11,845 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-10-15 01:38:11,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-15 01:38:11,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:37, output treesize:13 [2019-10-15 01:38:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:38:11,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169993462] [2019-10-15 01:38:11,933 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-15 01:38:11,933 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:38:11,939 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:38:11,956 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:38:11,957 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:38:12,173 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:38:12,433 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 01:38:12,545 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-15 01:38:19,101 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 165 for LOIs [2019-10-15 01:38:19,110 INFO L199 IcfgInterpreter]: Interpreting procedure ReadFromPort with input of size 19 for LOIs [2019-10-15 01:38:19,121 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:38:19,127 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:38:19,963 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-10-15 01:38:21,187 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:38:21,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 17] total 38 [2019-10-15 01:38:21,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14354518] [2019-10-15 01:38:21,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-15 01:38:21,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:38:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-15 01:38:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 01:38:21,194 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 38 states. [2019-10-15 01:38:21,524 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-15 01:38:21,961 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-15 01:38:22,294 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-15 01:38:22,757 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-15 01:38:23,608 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 170 [2019-10-15 01:38:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:38:24,302 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-10-15 01:38:24,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:38:24,303 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 22 [2019-10-15 01:38:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:38:24,303 INFO L225 Difference]: With dead ends: 36 [2019-10-15 01:38:24,304 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:38:24,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=307, Invalid=2449, Unknown=0, NotChecked=0, Total=2756 [2019-10-15 01:38:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:38:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:38:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:38:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:38:24,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-15 01:38:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:38:24,307 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:38:24,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-15 01:38:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:38:24,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:38:24,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:38:24,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:38:24,843 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-10-15 01:38:25,081 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-10-15 01:38:25,420 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 1 [2019-10-15 01:38:25,629 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-15 01:38:25,794 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-15 01:38:25,797 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-15 01:38:25,797 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:38:25,797 INFO L446 ceAbstractionStarter]: At program point ReadFromPortENTRY(lines 7 11) the Hoare annotation is: true [2019-10-15 01:38:25,797 INFO L443 ceAbstractionStarter]: For program point ReadFromPortEXIT(lines 7 11) no Hoare annotation was computed. [2019-10-15 01:38:25,798 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:38:25,798 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#NULL.offset| 0) (<= ~SIZE~0 0)) [2019-10-15 01:38:25,798 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:38:25,798 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:38:25,798 INFO L439 ceAbstractionStarter]: At program point L31-3(lines 31 52) the Hoare annotation is: (let ((.cse0 (select |#memory_int| main_~a~0.base)) (.cse1 (= main_~FIXEDVAL~0 10)) (.cse2 (= main_~DEFAULTVAL~0 0))) (or (and (<= ~SIZE~0 100000) (= main_~a~0.offset 0) (= |main_#t~malloc3.offset| 0) (<= main_~value~0 2147483647) (<= 2 ~SIZE~0) (<= 1 main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse0 (+ main_~a~0.offset 4)))) (<= 0 (+ main_~value~0 2147483648)) (not (= main_~DEFAULTVAL~0 (select .cse0 main_~a~0.offset))) .cse1 .cse2) (not (= |#NULL.offset| 0)) (not (= 100000 ~MAX~0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (let ((.cse3 (div ~SIZE~0 2))) (and (= 0 (select |old(#valid)| |main_#t~malloc3.base|)) (<= main_~a~0.offset 0) (= main_~a~0.offset |main_#t~malloc3.offset|) (< ~SIZE~0 ~MAX~0) (= main_~i~0 1) (<= 0 main_~a~0.offset) (= |main_#t~malloc3.base| main_~a~0.base) (< |#StackHeapBarrier| |main_#t~malloc3.base|) (<= 1 .cse3) (= |#valid| (store |old(#valid)| |main_#t~malloc3.base| 1)) (or (= (* 2 .cse3) ~SIZE~0) (not (= (select .cse0 0) main_~DEFAULTVAL~0))) (= |#memory_int| |old(#memory_int)|) .cse1 (not (= |main_#t~malloc3.base| 0)) (= (store |old(#length)| |main_#t~malloc3.base| (* ~SIZE~0 4)) |#length|) .cse2)) (not (<= |old(~SIZE~0)| 0)) (not (<= 0 |old(~SIZE~0)|)) (not (<= |#NULL.base| 0)))) [2019-10-15 01:38:25,798 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 60) no Hoare annotation was computed. [2019-10-15 01:38:25,799 INFO L439 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= 100000 ~MAX~0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |old(~SIZE~0)| 0)) (not (<= 0 |old(~SIZE~0)|)) (not (<= |#NULL.base| 0)) (let ((.cse41 (select |#memory_int| main_~a~0.base))) (and (exists ((v_main_~i~0_48 Int)) (let ((.cse39 (div ~SIZE~0 2)) (.cse40 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_48 8) main_~a~0.offset (- 12)))) (.cse9 (= main_~value~0 main_~DEFAULTVAL~0)) (.cse25 (= (mod ~SIZE~0 2) 0))) (let ((.cse33 (not .cse25)) (.cse34 (< ~SIZE~0 0)) (.cse37 (<= 0 ~SIZE~0)) (.cse36 (not .cse9)) (.cse38 (= main_~value~0 .cse40)) (.cse0 (<= ~MAX~0 100000)) (.cse1 (<= |main_#t~malloc3.offset| 0)) (.cse2 (= |old(~SIZE~0)| 0)) (.cse3 (<= 0 |main_#t~malloc3.offset|)) (.cse4 (< .cse39 v_main_~i~0_48)) (.cse5 (<= 2 v_main_~i~0_48)) (.cse6 (<= 0 |#NULL.base|)) (.cse7 (= |main_#t~malloc3.offset| 0)) (.cse8 (= ~MAX~0 100000)) (.cse10 (<= 0 |#NULL.offset|)) (.cse11 (<= 0 (+ main_~value~0 2147483648))) (.cse12 (<= 10 main_~FIXEDVAL~0)) (.cse13 (<= main_~DEFAULTVAL~0 0)) (.cse14 (<= 100000 ~MAX~0)) (.cse15 (= |#NULL.base| 0)) (.cse16 (<= ~SIZE~0 100000)) (.cse17 (<= |#NULL.base| 0)) (.cse18 (<= 1 ~SIZE~0)) (.cse19 (<= main_~a~0.offset 0)) (.cse20 (<= 0 main_~a~0.offset)) (.cse21 (<= 0 |old(~SIZE~0)|)) (.cse22 (<= |#NULL.offset| 0)) (.cse23 (<= main_~value~0 2147483647)) (.cse24 (= .cse40 main_~FIXEDVAL~0)) (.cse35 (< (+ .cse39 1) v_main_~i~0_48)) (.cse26 (<= |old(~SIZE~0)| 0)) (.cse27 (<= main_~FIXEDVAL~0 10)) (.cse28 (= main_~FIXEDVAL~0 10)) (.cse29 (<= 0 main_~DEFAULTVAL~0)) (.cse30 (= |#NULL.offset| 0)) (.cse31 (= main_~i~0 0)) (.cse32 (= main_~DEFAULTVAL~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse35 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse36 .cse11 .cse37 .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse36 .cse11 .cse38 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse35 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse36 .cse11 .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse35 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse36 .cse11 .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse35 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))))) (not (= main_~DEFAULTVAL~0 (select .cse41 (+ main_~a~0.offset 4)))) (not (= main_~DEFAULTVAL~0 (select .cse41 main_~a~0.offset))) (= (select .cse41 (+ (* main_~i~0 4) main_~a~0.offset)) |main_#t~mem8|) (<= 2 ~SIZE~0)))) [2019-10-15 01:38:25,799 INFO L443 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2019-10-15 01:38:25,799 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-15 01:38:25,799 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 58) no Hoare annotation was computed. [2019-10-15 01:38:25,799 INFO L443 ceAbstractionStarter]: For program point L20-1(lines 20 58) no Hoare annotation was computed. [2019-10-15 01:38:25,800 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (<= 2 ~SIZE~0)) (.cse1 (select |#memory_int| main_~a~0.base)) (.cse2 (= main_~FIXEDVAL~0 10)) (.cse3 (= main_~DEFAULTVAL~0 0))) (or (and (<= ~SIZE~0 100000) (= main_~a~0.offset 0) (= |main_#t~malloc3.offset| 0) (<= main_~value~0 2147483647) .cse0 (<= 1 main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse1 (+ main_~a~0.offset 4)))) (<= 0 (+ main_~value~0 2147483648)) (not (= main_~DEFAULTVAL~0 (select .cse1 main_~a~0.offset))) .cse2 .cse3) (and (= 0 (select |old(#valid)| |main_#t~malloc3.base|)) (<= main_~a~0.offset 0) (= main_~a~0.offset |main_#t~malloc3.offset|) (< ~SIZE~0 ~MAX~0) (= main_~i~0 1) (<= 0 main_~a~0.offset) (= |main_#t~malloc3.base| main_~a~0.base) .cse0 (< |#StackHeapBarrier| |main_#t~malloc3.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc3.base| 1)) (or (= (* 2 (div ~SIZE~0 2)) ~SIZE~0) (not (= (select .cse1 0) main_~DEFAULTVAL~0))) (= |#memory_int| |old(#memory_int)|) .cse2 (not (= |main_#t~malloc3.base| 0)) (= (store |old(#length)| |main_#t~malloc3.base| (* ~SIZE~0 4)) |#length|) .cse3) (not (= |#NULL.offset| 0)) (not (= 100000 ~MAX~0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |old(~SIZE~0)| 0)) (not (<= 0 |old(~SIZE~0)|)) (not (<= |#NULL.base| 0)))) [2019-10-15 01:38:25,800 INFO L443 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2019-10-15 01:38:25,800 INFO L439 ceAbstractionStarter]: At program point L54-3(lines 54 57) the Hoare annotation is: (let ((.cse5 (select |#memory_int| main_~a~0.base))) (let ((.cse0 (<= ~SIZE~0 100000)) (.cse1 (<= 2 ~SIZE~0)) (.cse2 (not (= main_~DEFAULTVAL~0 (select .cse5 (+ main_~a~0.offset 4))))) (.cse3 (not (= main_~DEFAULTVAL~0 (select .cse5 main_~a~0.offset)))) (.cse4 (= main_~DEFAULTVAL~0 0))) (or (and .cse0 (<= main_~a~0.offset 0) (= main_~i~0 1) (<= 0 main_~a~0.offset) (= |main_#t~malloc3.offset| 0) (<= main_~value~0 2147483647) .cse1 .cse2 (<= 0 (+ main_~value~0 2147483648)) .cse3 (= main_~FIXEDVAL~0 10) .cse4) (and .cse0 (= main_~a~0.offset 0) .cse1 .cse2 .cse3 (<= 10 main_~FIXEDVAL~0) (= main_~i~0 0) .cse4) (not (= |#NULL.offset| 0)) (not (= 100000 ~MAX~0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |old(~SIZE~0)| 0)) (not (<= 0 |old(~SIZE~0)|)) (not (<= |#NULL.base| 0))))) [2019-10-15 01:38:25,800 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 60) no Hoare annotation was computed. [2019-10-15 01:38:25,801 INFO L439 ceAbstractionStarter]: At program point L34-2(lines 34 41) the Hoare annotation is: (let ((.cse0 (<= ~SIZE~0 100000)) (.cse5 (select |#memory_int| main_~a~0.base)) (.cse1 (= main_~a~0.offset 0)) (.cse2 (= |main_#t~malloc3.offset| 0)) (.cse3 (<= main_~value~0 2147483647)) (.cse4 (<= 2 ~SIZE~0)) (.cse6 (<= 0 (+ main_~value~0 2147483648))) (.cse7 (= main_~FIXEDVAL~0 10)) (.cse8 (= main_~DEFAULTVAL~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 main_~i~0) (not (= main_~DEFAULTVAL~0 (select .cse5 (+ main_~a~0.offset 4)))) .cse6 (not (= main_~DEFAULTVAL~0 (select .cse5 main_~a~0.offset))) .cse7 .cse8) (not (= |#NULL.offset| 0)) (not (= 100000 ~MAX~0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |old(~SIZE~0)| 0)) (not (<= 0 |old(~SIZE~0)|)) (not (<= |#NULL.base| 0)) (and .cse0 (not (= main_~DEFAULTVAL~0 (let ((.cse9 (* main_~i~0 8))) (select (store .cse5 (+ .cse9 main_~a~0.offset (- 4)) main_~FIXEDVAL~0) (+ .cse9 main_~a~0.offset (- 8)))))) (= main_~i~0 1) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8))) [2019-10-15 01:38:25,801 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 17 60) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= 100000 ~MAX~0)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|) (= |old(~SIZE~0)| ~SIZE~0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |old(~SIZE~0)| 0)) (not (<= 0 |old(~SIZE~0)|)) (not (<= |#NULL.base| 0))) [2019-10-15 01:38:25,801 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-15 01:38:25,801 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-15 01:38:25,801 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-15 01:38:25,802 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-15 01:38:25,802 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-15 01:38:25,802 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-15 01:38:25,802 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-15 01:38:25,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 01:38:25,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 01:38:25,825 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,827 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,828 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:38:25 BoogieIcfgContainer [2019-10-15 01:38:25,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:38:25,837 INFO L168 Benchmark]: Toolchain (without parser) took 16815.41 ms. Allocated memory was 137.4 MB in the beginning and 504.9 MB in the end (delta: 367.5 MB). Free memory was 102.3 MB in the beginning and 415.2 MB in the end (delta: -312.9 MB). Peak memory consumption was 384.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:38:25,837 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:38:25,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.03 ms. Allocated memory is still 137.4 MB. Free memory was 102.1 MB in the beginning and 91.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:38:25,838 INFO L168 Benchmark]: Boogie Preprocessor took 137.53 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.6 MB in the beginning and 177.5 MB in the end (delta: -85.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:38:25,838 INFO L168 Benchmark]: RCFGBuilder took 426.44 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 155.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:38:25,839 INFO L168 Benchmark]: TraceAbstraction took 15927.93 ms. Allocated memory was 200.3 MB in the beginning and 504.9 MB in the end (delta: 304.6 MB). Free memory was 155.1 MB in the beginning and 415.2 MB in the end (delta: -260.1 MB). Peak memory consumption was 374.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:38:25,840 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 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.03 ms. Allocated memory is still 137.4 MB. Free memory was 102.1 MB in the beginning and 91.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.53 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.6 MB in the beginning and 177.5 MB in the end (delta: -85.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 426.44 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 155.1 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15927.93 ms. Allocated memory was 200.3 MB in the beginning and 504.9 MB in the end (delta: 304.6 MB). Free memory was 155.1 MB in the beginning and 415.2 MB in the end (delta: -260.1 MB). Peak memory consumption was 374.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #StackHeapBarrier - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2019-10-15 01:38:25,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 01:38:25,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-15 01:38:25,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-15 01:38:25,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((((((((((((SIZE <= 100000 && a == 0) && malloc(sizeof(int)*SIZE) == 0) && value <= 2147483647) && 2 <= SIZE) && 1 <= i) && !(DEFAULTVAL == unknown-#memory_int-unknown[a][a + 4])) && 0 <= value + 2147483648) && !(DEFAULTVAL == unknown-#memory_int-unknown[a][a])) && FIXEDVAL == 10) && DEFAULTVAL == 0) || !(#NULL == 0)) || !(100000 == MAX)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || (((((((((((((((0 == \old(\valid)[malloc(sizeof(int)*SIZE)] && a <= 0) && a == malloc(sizeof(int)*SIZE)) && SIZE < MAX) && i == 1) && 0 <= a) && malloc(sizeof(int)*SIZE) == a) && unknown-#StackHeapBarrier-unknown < malloc(sizeof(int)*SIZE)) && 1 <= SIZE / 2) && \valid == \old(\valid)[malloc(sizeof(int)*SIZE) := 1]) && (2 * (SIZE / 2) == SIZE || !(unknown-#memory_int-unknown[a][0] == DEFAULTVAL))) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && FIXEDVAL == 10) && !(malloc(sizeof(int)*SIZE) == 0)) && \old(unknown-#length-unknown)[malloc(sizeof(int)*SIZE) := SIZE * 4] == unknown-#length-unknown) && DEFAULTVAL == 0)) || !(\old(SIZE) <= 0)) || !(0 <= \old(SIZE))) || !(#NULL <= 0) - InvariantResult [Line: 54]: Loop Invariant [2019-10-15 01:38:25,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:38:25,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-15 01:38:25,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((((((((((((SIZE <= 100000 && a <= 0) && i == 1) && 0 <= a) && malloc(sizeof(int)*SIZE) == 0) && value <= 2147483647) && 2 <= SIZE) && !(DEFAULTVAL == unknown-#memory_int-unknown[a][a + 4])) && 0 <= value + 2147483648) && !(DEFAULTVAL == unknown-#memory_int-unknown[a][a])) && FIXEDVAL == 10) && DEFAULTVAL == 0) || (((((((SIZE <= 100000 && a == 0) && 2 <= SIZE) && !(DEFAULTVAL == unknown-#memory_int-unknown[a][a + 4])) && !(DEFAULTVAL == unknown-#memory_int-unknown[a][a])) && 10 <= FIXEDVAL) && i == 0) && DEFAULTVAL == 0)) || !(#NULL == 0)) || !(100000 == MAX)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(\old(SIZE) <= 0)) || !(0 <= \old(SIZE))) || !(#NULL <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 15.8s, OverallIterations: 2, TraceHistogramMax: 2, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 36 SDtfs, 85 SDslu, 93 SDs, 0 SdLazy, 533 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 22 NumberOfFragments, 1644 HoareAnnotationTreeSize, 16 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 4284 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 9315 SizeOfPredicates, 14 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 7194, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 223, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 90, TOOLS_POST_TIME[ms]: 2755, TOOLS_POST_CALL_APPLICATIONS: 99, TOOLS_POST_CALL_TIME[ms]: 758, TOOLS_POST_RETURN_APPLICATIONS: 94, TOOLS_POST_RETURN_TIME[ms]: 107, TOOLS_QUANTIFIERELIM_APPLICATIONS: 283, TOOLS_QUANTIFIERELIM_TIME[ms]: 3507, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 155, FLUID_QUERY_TIME[ms]: 10, FLUID_QUERIES: 241, FLUID_YES_ANSWERS: 1, DOMAIN_JOIN_APPLICATIONS: 146, DOMAIN_JOIN_TIME[ms]: 3096, DOMAIN_ALPHA_APPLICATIONS: 1, DOMAIN_ALPHA_TIME[ms]: 2, DOMAIN_WIDEN_APPLICATIONS: 9, DOMAIN_WIDEN_TIME[ms]: 175, DOMAIN_ISSUBSETEQ_APPLICATIONS: 18, DOMAIN_ISSUBSETEQ_TIME[ms]: 43, DOMAIN_ISBOTTOM_APPLICATIONS: 51, DOMAIN_ISBOTTOM_TIME[ms]: 106, LOOP_SUMMARIZER_APPLICATIONS: 9, LOOP_SUMMARIZER_CACHE_MISSES: 9, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 4627, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 4626, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 18, CALL_SUMMARIZER_APPLICATIONS: 94, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 69, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 68, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 39, DAG_COMPRESSION_PROCESSED_NODES: 240, DAG_COMPRESSION_RETAINED_NODES: 120, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...