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/loops/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:44:08,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:44:08,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:44:08,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:44:08,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:44:08,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:44:08,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:44:08,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:44:08,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:44:08,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:44:08,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:44:08,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:44:08,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:44:08,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:44:08,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:44:08,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:44:08,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:44:08,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:44:08,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:44:08,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:44:08,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:44:08,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:44:08,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:44:08,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:44:08,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:44:08,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:44:08,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:44:08,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:44:08,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:44:08,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:44:08,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:44:08,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:44:08,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:44:08,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:44:08,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:44:08,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:44:08,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:44:08,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:44:08,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:44:08,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:44:08,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:44:08,214 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-07 13:44:08,228 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:44:08,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:44:08,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:44:08,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:44:08,230 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:44:08,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:44:08,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:44:08,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:44:08,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:44:08,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:44:08,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:44:08,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:44:08,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:44:08,232 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:44:08,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:44:08,232 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:44:08,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:44:08,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:44:08,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:44:08,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:44:08,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:44:08,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:44:08,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:44:08,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:44:08,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:44:08,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:44:08,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:44:08,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:44:08,235 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-07 13:44:08,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:44:08,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:44:08,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:44:08,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:44:08,520 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:44:08,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-2.c [2019-10-07 13:44:08,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1379bd20d/55e26b840ef946ce9339f073a4553c21/FLAGdb3d596b6 [2019-10-07 13:44:09,031 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:44:09,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c [2019-10-07 13:44:09,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1379bd20d/55e26b840ef946ce9339f073a4553c21/FLAGdb3d596b6 [2019-10-07 13:44:09,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1379bd20d/55e26b840ef946ce9339f073a4553c21 [2019-10-07 13:44:09,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:44:09,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:44:09,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:44:09,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:44:09,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:44:09,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734aed89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09, skipping insertion in model container [2019-10-07 13:44:09,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:44:09,418 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:44:09,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:44:09,669 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:44:09,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:44:09,823 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:44:09,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09 WrapperNode [2019-10-07 13:44:09,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:44:09,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:44:09,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:44:09,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:44:09,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:44:09,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:44:09,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:44:09,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:44:09,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44: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-07 13:44:09,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:44:09,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:44:09,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:44:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:44:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:44:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:44:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:44:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:44:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:44:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-07 13:44:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:44:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:44:10,263 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:44:10,264 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 13:44:10,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:44:10 BoogieIcfgContainer [2019-10-07 13:44:10,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:44:10,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:44:10,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:44:10,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:44:10,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:44:09" (1/3) ... [2019-10-07 13:44:10,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5440b673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:44:10, skipping insertion in model container [2019-10-07 13:44:10,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (2/3) ... [2019-10-07 13:44:10,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5440b673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:44:10, skipping insertion in model container [2019-10-07 13:44:10,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:44:10" (3/3) ... [2019-10-07 13:44:10,272 INFO L109 eAbstractionObserver]: Analyzing ICFG heavy-2.c [2019-10-07 13:44:10,282 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:44:10,289 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:44:10,300 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:44:10,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:44:10,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:44:10,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:44:10,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:44:10,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:44:10,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:44:10,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:44:10,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:44:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-10-07 13:44:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-07 13:44:10,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:10,342 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:10,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash -12510755, now seen corresponding path program 1 times [2019-10-07 13:44:10,354 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:10,354 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,354 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,354 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:10,515 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-07 13:44:10,515 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,516 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:44:10,516 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:44:10,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:44:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:44:10,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:44:10,533 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-10-07 13:44:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:10,579 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-10-07 13:44:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:44:10,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-07 13:44:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:10,589 INFO L225 Difference]: With dead ends: 25 [2019-10-07 13:44:10,589 INFO L226 Difference]: Without dead ends: 14 [2019-10-07 13:44:10,592 INFO L606 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-07 13:44:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-07 13:44:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-10-07 13:44:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:44:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-10-07 13:44:10,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-10-07 13:44:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:10,623 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-07 13:44:10,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:44:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-10-07 13:44:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:44:10,624 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:10,624 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:10,625 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 821858575, now seen corresponding path program 1 times [2019-10-07 13:44:10,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:10,625 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:10,680 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,680 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:44:10,680 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:44:10,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:44:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:44:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:44:10,682 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-10-07 13:44:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:10,714 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-10-07 13:44:10,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:44:10,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:44:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:10,716 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:44:10,716 INFO L226 Difference]: Without dead ends: 14 [2019-10-07 13:44:10,717 INFO L606 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-07 13:44:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-07 13:44:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-07 13:44:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-07 13:44:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-10-07 13:44:10,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-10-07 13:44:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:10,722 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-07 13:44:10,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:44:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-10-07 13:44:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:44:10,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:10,723 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:10,723 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1551678377, now seen corresponding path program 1 times [2019-10-07 13:44:10,724 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:10,724 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,725 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:10,827 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-07 13:44:10,828 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,828 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:10,828 INFO L95 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-07 13:44:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:10,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:44:10,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:10,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:10,954 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:44:10,954 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [4] total 7 [2019-10-07 13:44:10,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:44:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:44:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:44:10,956 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2019-10-07 13:44:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:11,019 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-10-07 13:44:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:44:11,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-07 13:44:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:11,021 INFO L225 Difference]: With dead ends: 27 [2019-10-07 13:44:11,021 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 13:44:11,022 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:44:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 13:44:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-10-07 13:44:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:44:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-07 13:44:11,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-10-07 13:44:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:11,027 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-07 13:44:11,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:44:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-10-07 13:44:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:44:11,029 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:11,029 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:11,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:11,234 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1033585897, now seen corresponding path program 1 times [2019-10-07 13:44:11,236 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:11,236 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:11,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:11,237 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:11,361 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:11,362 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:11,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:44:11,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:44:11,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:44:11,576 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:44:11,621 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:44:11,622 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:44:11,629 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:44:11,636 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:44:11,637 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:44:11,876 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 36 for LOIs [2019-10-07 13:44:13,014 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,115 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,228 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,316 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,393 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,467 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,544 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,614 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,681 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,747 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,823 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:13,891 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:14,223 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:14,288 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:14,353 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:14,417 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:14,489 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:14,564 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:16,783 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_int_29| |~#array~0.base|)) (.cse1 (mod main_~j~0 4294967296))) (= (select .cse0 (+ |~#array~0.offset| .cse1 (- 4294967296))) (mod (+ (select .cse0 (+ (mod (+ main_~k~0 4294967295) 4294967296) |~#array~0.offset|)) (select .cse0 (+ |~#array~0.offset| .cse1))) 256))) [2019-10-07 13:44:16,926 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:16,987 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,279 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,332 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,389 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,450 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,512 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,578 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,626 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,678 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,934 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:17,984 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,025 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,082 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,436 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,481 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,526 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,592 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,647 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,705 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,785 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,853 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,911 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:18,952 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,002 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,056 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,114 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,161 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,203 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,248 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,290 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,338 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,383 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,443 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,485 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,523 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,563 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,601 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,639 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,866 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:19,906 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:20,138 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:20,377 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:20,421 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:20,468 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:20,961 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,222 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,265 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,306 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,351 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,395 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,644 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,686 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,728 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:21,988 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,029 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,293 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,331 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,370 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,414 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,454 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,495 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,556 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,644 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,685 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,945 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:22,987 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,035 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,076 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,115 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,393 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,458 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,492 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,527 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,565 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,603 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,641 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,681 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,718 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,754 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,794 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,831 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,870 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,908 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,953 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:23,992 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,028 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,215 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,267 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,307 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,363 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,401 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:24,459 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:25,797 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 451 [2019-10-07 13:44:25,882 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:26,009 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:26,171 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:26,194 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:26,594 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:26,628 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:26,932 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:27,048 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:27,406 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:44:27,639 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-07 13:44:27,648 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:44:27,648 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:44:27,648 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= |~#array~0.offset| 0) (= 1048576 (select |#length| |~#array~0.base|)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1) (select |#memory_int| |~#array~0.base|)) (<= 0 |~#array~0.offset|) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|) (not (= 0 |~#array~0.base|))) [2019-10-07 13:44:27,649 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= |~#array~0.offset| 0) (= 1048576 (select |#length| |~#array~0.base|)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |~#array~0.offset|) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|) (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1)) (not (= 0 |~#array~0.base|))) [2019-10-07 13:44:27,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 278#(and (<= |~#array~0.offset| 0) (= 0 |#NULL.base|) (= 0 (select (store |old(#valid)| 0 0) |~#array~0.base|)) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store (store |old(#valid)| 0 0) |~#array~0.base| 1)) (<= 0 |#NULL.base|) (= (store |old(#memory_int)| |~#array~0.base| (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1)) |#memory_int|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |~#array~0.offset|) (= |#length| (store |old(#length)| |~#array~0.base| 1048576)) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|) (not (= 0 |~#array~0.base|))) [2019-10-07 13:44:27,649 INFO L193 IcfgInterpreter]: Reachable states at location L10-4 satisfy 245#(not (< (mod main_~i~0 4294967296) 1048576)) [2019-10-07 13:44:27,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:44:27,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 273#(and (= |old(~#array~0.base)| |~#array~0.base|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) [2019-10-07 13:44:27,650 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 240#true [2019-10-07 13:44:27,650 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 199#(or (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 1 main_~a~0) (< |~#array~0.base| |#StackHeapBarrier|) (= |main_#in~argv.base| main_~argv.base) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (< (mod main_~i~0 4294967296) 1048576) (<= main_~a~0 1) (<= 0 |~#array~0.offset|) (= main_~j~0 0) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|) (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1)) (<= main_~j~0 0) (not (= 0 |~#array~0.base|)) (<= |~#array~0.offset| 0) (= 1048576 (select |#length| |~#array~0.base|)) (<= |#NULL.base| 0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= |main_#in~argc| main_~argc) (= |main_#in~argv.offset| main_~argv.offset) (= main_~a~0 1) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< (mod main_~k~0 4294967296) 1048576))) [2019-10-07 13:44:27,654 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 269#true [2019-10-07 13:44:27,655 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 184#true [2019-10-07 13:44:27,655 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 255#true [2019-10-07 13:44:28,029 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-07 13:44:28,053 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:44:28,054 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 7] total 19 [2019-10-07 13:44:28,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 13:44:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 13:44:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:44:28,056 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 19 states. [2019-10-07 13:44:28,387 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-07 13:44:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:29,259 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-10-07 13:44:29,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 13:44:29,260 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2019-10-07 13:44:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:29,262 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:44:29,262 INFO L226 Difference]: Without dead ends: 38 [2019-10-07 13:44:29,264 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 13:44:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-07 13:44:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-07 13:44:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:44:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-10-07 13:44:29,272 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 14 [2019-10-07 13:44:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:29,273 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-07 13:44:29,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 13:44:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-10-07 13:44:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:44:29,274 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:29,274 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:29,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:29,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:29,475 INFO L82 PathProgramCache]: Analyzing trace with hash 83697117, now seen corresponding path program 2 times [2019-10-07 13:44:29,476 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:29,476 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:29,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:29,477 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-07 13:44:29,749 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:29,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:29,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:29,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-07 13:44:29,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:44:29,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:44:29,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-07 13:44:29,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-07 13:44:29,836 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:44:29,836 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-07 13:44:29,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:44:29,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:44:29,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:44:29,838 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2019-10-07 13:44:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:29,843 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-07 13:44:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:44:29,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-07 13:44:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:29,845 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:44:29,845 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:44:29,845 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:44:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:44:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:44:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:44:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:44:29,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-10-07 13:44:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:29,847 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:44:29,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:44:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:44:29,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:44:30,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:30,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:44:30,337 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-10-07 13:44:30,472 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-07 13:44:30,552 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~#array~0.base)| |~#array~0.base|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|)) [2019-10-07 13:44:30,552 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:44:30,552 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:44:30,552 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1048576 (select |#length| |~#array~0.base|)) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (= (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1) (select |#memory_int| |~#array~0.base|)) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|)) [2019-10-07 13:44:30,552 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:44:30,552 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:44:30,552 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 5 21) no Hoare annotation was computed. [2019-10-07 13:44:30,552 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 5 21) no Hoare annotation was computed. [2019-10-07 13:44:30,553 INFO L439 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (not (< |~#array~0.base| |#StackHeapBarrier|)) (and (< (mod main_~i~0 4294967296) 1048576) (or (and (= |main_#in~argv.base| main_~argv.base) (= |main_#in~argc| main_~argc) (= |main_#in~argv.offset| main_~argv.offset) (= main_~j~0 0) (= |#memory_int| |old(#memory_int)|) (= main_~i~0 0)) (<= 1048576 (mod main_~k~0 4294967296))) (= main_~a~0 1))) [2019-10-07 13:44:30,553 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 5 21) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (= |#memory_int| |old(#memory_int)|) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (not (< |~#array~0.base| |#StackHeapBarrier|))) [2019-10-07 13:44:30,553 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2019-10-07 13:44:30,553 INFO L439 ceAbstractionStarter]: At program point L16(lines 6 21) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (not (< |~#array~0.base| |#StackHeapBarrier|))) [2019-10-07 13:44:30,553 INFO L439 ceAbstractionStarter]: At program point L12-3(lines 12 13) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (and (< (mod main_~i~0 4294967296) 1048576) (= main_~a~0 1)) (not (< |~#array~0.base| |#StackHeapBarrier|))) [2019-10-07 13:44:30,554 INFO L439 ceAbstractionStarter]: At program point L10-3(lines 10 13) the Hoare annotation is: (let ((.cse0 (= main_~a~0 1))) (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (and (<= 1048576 (mod main_~k~0 4294967296)) .cse0) (not (< |~#array~0.base| |#StackHeapBarrier|)) (and .cse0 (= |#memory_int| |old(#memory_int)|) (= main_~i~0 0)))) [2019-10-07 13:44:30,554 INFO L443 ceAbstractionStarter]: For program point L10-4(lines 6 21) no Hoare annotation was computed. [2019-10-07 13:44:30,557 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 13:44:30,561 INFO L168 Benchmark]: Toolchain (without parser) took 21174.24 ms. Allocated memory was 144.7 MB in the beginning and 472.4 MB in the end (delta: 327.7 MB). Free memory was 102.8 MB in the beginning and 402.2 MB in the end (delta: -299.4 MB). Peak memory consumption was 323.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:30,562 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 13:44:30,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.12 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 180.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:30,563 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 201.3 MB. Free memory was 180.5 MB in the beginning and 177.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:30,564 INFO L168 Benchmark]: RCFGBuilder took 402.33 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 159.9 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:30,565 INFO L168 Benchmark]: TraceAbstraction took 20293.55 ms. Allocated memory was 201.3 MB in the beginning and 472.4 MB in the end (delta: 271.1 MB). Free memory was 159.9 MB in the beginning and 402.2 MB in the end (delta: -242.2 MB). Peak memory consumption was 324.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:30,568 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.12 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 180.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 201.3 MB. Free memory was 180.5 MB in the beginning and 177.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 402.33 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 159.9 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20293.55 ms. Allocated memory was 201.3 MB in the beginning and 472.4 MB in the end (delta: 271.1 MB). Free memory was 159.9 MB in the beginning and 402.2 MB in the end (delta: -242.2 MB). Peak memory consumption was 324.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: 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 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...