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-examples/standard_copy6_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:35,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:35,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:35,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:35,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:35,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:35,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:35,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:35,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:35,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:35,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:35,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:35,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:35,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:35,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:35,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:35,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:35,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:35,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:35,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:35,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:35,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:35,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:35,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:35,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:35,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:35,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:35,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:35,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:35,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:35,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:35,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:35,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:35,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:35,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:35,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:35,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:35,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:35,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:35,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:35,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:35,436 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-13 21:33:35,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:35,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:35,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:35,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:35,459 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:35,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:35,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:35,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:35,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:35,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:35,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:35,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:35,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:35,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:35,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:35,462 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:35,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:35,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:35,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:35,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:35,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:35,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:35,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:35,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:35,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:35,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:35,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:35,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:35,465 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-13 21:33:35,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:35,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:35,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:35,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:35,744 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:35,745 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i [2019-10-13 21:33:35,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56411cc47/d0638c1f574f4d90ab99f7f2c45c142d/FLAG3033f194c [2019-10-13 21:33:36,268 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:36,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_ground-2.i [2019-10-13 21:33:36,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56411cc47/d0638c1f574f4d90ab99f7f2c45c142d/FLAG3033f194c [2019-10-13 21:33:36,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56411cc47/d0638c1f574f4d90ab99f7f2c45c142d [2019-10-13 21:33:36,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:36,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:36,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:36,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:36,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:36,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:36,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6ea3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36, skipping insertion in model container [2019-10-13 21:33:36,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:36,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:36,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:36,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:36,919 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:36,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:36,972 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:36,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36 WrapperNode [2019-10-13 21:33:36,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:36,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:36,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:36,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:37,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (1/1) ... [2019-10-13 21:33:37,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:37,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:37,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:37,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:37,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (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-13 21:33:37,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:37,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:37,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:37,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:37,726 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:37,726 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-13 21:33:37,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:37 BoogieIcfgContainer [2019-10-13 21:33:37,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:37,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:37,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:37,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:37,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:36" (1/3) ... [2019-10-13 21:33:37,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211b4b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:37, skipping insertion in model container [2019-10-13 21:33:37,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:36" (2/3) ... [2019-10-13 21:33:37,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211b4b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:37, skipping insertion in model container [2019-10-13 21:33:37,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:37" (3/3) ... [2019-10-13 21:33:37,737 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy6_ground-2.i [2019-10-13 21:33:37,748 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:37,758 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:37,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:37,796 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:37,796 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:37,796 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:37,797 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:37,797 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:37,797 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:37,797 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:37,797 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-13 21:33:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:33:37,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:37,819 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:37,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash 385694572, now seen corresponding path program 1 times [2019-10-13 21:33:37,832 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:37,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696320272] [2019-10-13 21:33:37,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:37,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:37,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,018 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-13 21:33:38,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696320272] [2019-10-13 21:33:38,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:38,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:38,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740395280] [2019-10-13 21:33:38,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:38,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:38,045 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-13 21:33:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:38,084 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-10-13 21:33:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:38,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 21:33:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:38,097 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:33:38,098 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:33:38,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:33:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:33:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:33:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-10-13 21:33:38,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2019-10-13 21:33:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:38,151 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-13 21:33:38,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-10-13 21:33:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:38,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:38,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:38,153 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash 927885985, now seen corresponding path program 1 times [2019-10-13 21:33:38,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:38,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367092155] [2019-10-13 21:33:38,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:38,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367092155] [2019-10-13 21:33:38,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:38,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:38,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417543166] [2019-10-13 21:33:38,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:38,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:38,273 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 3 states. [2019-10-13 21:33:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:38,354 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-10-13 21:33:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:38,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 21:33:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:38,357 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:33:38,357 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 21:33:38,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 21:33:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-13 21:33:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:33:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-13 21:33:38,366 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 18 [2019-10-13 21:33:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:38,366 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-13 21:33:38,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-10-13 21:33:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:33:38,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:38,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:38,368 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1980665252, now seen corresponding path program 1 times [2019-10-13 21:33:38,369 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:38,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239956421] [2019-10-13 21:33:38,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:38,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239956421] [2019-10-13 21:33:38,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652050762] [2019-10-13 21:33:38,519 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-13 21:33:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:38,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:38,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:38,678 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:38,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146670349] [2019-10-13 21:33:38,780 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:38,781 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:38,797 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:38,810 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:38,811 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:38,963 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:40,079 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:40,849 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:40,912 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:40,949 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:40,964 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:40,965 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:40,965 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,965 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:40,966 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,966 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:40,966 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,967 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,967 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,968 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:40,968 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:40,969 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:40,969 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:40,969 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,969 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:40,971 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,971 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:33:40,972 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,972 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,972 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:33:41,336 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:41,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:41,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609442360] [2019-10-13 21:33:41,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:41,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:41,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:41,340 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 18 states. [2019-10-13 21:33:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:42,098 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-10-13 21:33:42,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:42,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-13 21:33:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:42,100 INFO L225 Difference]: With dead ends: 67 [2019-10-13 21:33:42,100 INFO L226 Difference]: Without dead ends: 46 [2019-10-13 21:33:42,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-13 21:33:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-13 21:33:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:33:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-13 21:33:42,110 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2019-10-13 21:33:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:42,111 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-13 21:33:42,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-13 21:33:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:33:42,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:42,112 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:42,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:42,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1231684532, now seen corresponding path program 2 times [2019-10-13 21:33:42,315 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:42,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151000959] [2019-10-13 21:33:42,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:42,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:42,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:33:42,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151000959] [2019-10-13 21:33:42,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117407570] [2019-10-13 21:33:42,452 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:33:42,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:42,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:42,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:42,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:33:42,577 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:33:42,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911885659] [2019-10-13 21:33:42,617 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:42,617 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:42,618 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:42,618 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:42,618 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:42,649 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:42,981 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:43,477 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:44,104 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:44,112 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:44,115 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:44,115 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:44,116 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:44,116 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:44,116 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:44,116 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:44,116 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,117 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,117 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,117 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:44,117 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:44,117 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:44,118 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:44,118 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,118 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:44,118 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,118 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))))) [2019-10-13 21:33:44,119 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:44,119 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:44,119 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:33:44,462 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:44,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:44,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078684984] [2019-10-13 21:33:44,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:44,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:44,465 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 23 states. [2019-10-13 21:33:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:45,512 INFO L93 Difference]: Finished difference Result 98 states and 136 transitions. [2019-10-13 21:33:45,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:45,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2019-10-13 21:33:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:45,514 INFO L225 Difference]: With dead ends: 98 [2019-10-13 21:33:45,514 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 21:33:45,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 21:33:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-10-13 21:33:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 21:33:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-10-13 21:33:45,528 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 33 [2019-10-13 21:33:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:45,528 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-10-13 21:33:45,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-10-13 21:33:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:33:45,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:45,530 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:45,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:45,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash -652484159, now seen corresponding path program 3 times [2019-10-13 21:33:45,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:45,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728318616] [2019-10-13 21:33:45,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:45,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728318616] [2019-10-13 21:33:45,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890954193] [2019-10-13 21:33:45,923 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-13 21:33:46,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:46,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:46,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:46,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:46,106 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:46,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416218106] [2019-10-13 21:33:46,185 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:46,185 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:46,186 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:46,186 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:46,186 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:46,218 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:47,503 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:47,510 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:47,513 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:47,513 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:47,514 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,514 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:47,514 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,514 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:47,514 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,514 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,515 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,515 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:47,515 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,515 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,515 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:47,516 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:47,516 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,516 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) [2019-10-13 21:33:47,517 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:47,517 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:47,517 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:33:47,782 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:47,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:33:47,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78493485] [2019-10-13 21:33:47,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:33:47,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:47,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:33:47,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:33:47,785 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 25 states. [2019-10-13 21:33:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:48,577 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-10-13 21:33:48,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:33:48,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2019-10-13 21:33:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:48,578 INFO L225 Difference]: With dead ends: 129 [2019-10-13 21:33:48,578 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 21:33:48,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:33:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 21:33:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-10-13 21:33:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 21:33:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-10-13 21:33:48,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 58 [2019-10-13 21:33:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:48,591 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-10-13 21:33:48,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:33:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-10-13 21:33:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:33:48,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:48,594 INFO L380 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:48,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:48,797 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1192954356, now seen corresponding path program 4 times [2019-10-13 21:33:48,798 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:48,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018133547] [2019-10-13 21:33:48,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:48,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018133547] [2019-10-13 21:33:48,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994926676] [2019-10-13 21:33:48,992 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:49,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:49,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:49,123 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:49,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055413397] [2019-10-13 21:33:49,383 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:49,383 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:49,384 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:49,384 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:49,384 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:49,424 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:50,253 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:50,702 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:50,710 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:50,715 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:50,715 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:50,715 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:50,715 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:50,715 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:50,716 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:50,716 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,716 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,716 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,716 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:50,717 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:50,717 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:50,717 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:50,717 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,717 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:50,717 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,718 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) [2019-10-13 21:33:50,718 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:33:50,718 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:50,718 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:33:51,055 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:51,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:33:51,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726878334] [2019-10-13 21:33:51,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:33:51,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:33:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:33:51,059 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 39 states. [2019-10-13 21:33:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:52,456 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2019-10-13 21:33:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:33:52,456 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2019-10-13 21:33:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:52,458 INFO L225 Difference]: With dead ends: 143 [2019-10-13 21:33:52,458 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 21:33:52,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:33:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 21:33:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-10-13 21:33:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 21:33:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-10-13 21:33:52,489 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 65 [2019-10-13 21:33:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:52,490 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-10-13 21:33:52,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:33:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-10-13 21:33:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 21:33:52,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:52,494 INFO L380 BasicCegarLoop]: trace histogram [26, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:52,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:52,725 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1089225620, now seen corresponding path program 5 times [2019-10-13 21:33:52,726 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:52,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949659115] [2019-10-13 21:33:52,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 21:33:53,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949659115] [2019-10-13 21:33:53,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574604348] [2019-10-13 21:33:53,152 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:54,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:33:54,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:54,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:33:54,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-10-13 21:33:54,311 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-10-13 21:33:54,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045241696] [2019-10-13 21:33:54,462 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:33:54,462 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:54,463 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:54,463 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:54,463 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:54,483 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:54,716 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:55,696 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:55,705 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:55,707 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:55,707 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:55,708 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-13 21:33:55,708 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:55,708 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-13 21:33:55,708 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:55,708 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,708 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,709 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,709 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:55,709 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:55,709 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:55,709 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:55,710 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,710 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:55,710 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,710 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:55,710 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-13 21:33:55,711 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,711 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:33:56,157 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:56,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-13 21:33:56,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115016448] [2019-10-13 21:33:56,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 21:33:56,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 21:33:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:56,160 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 53 states. [2019-10-13 21:33:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:59,210 INFO L93 Difference]: Finished difference Result 192 states and 254 transitions. [2019-10-13 21:33:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 21:33:59,211 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 79 [2019-10-13 21:33:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:59,212 INFO L225 Difference]: With dead ends: 192 [2019-10-13 21:33:59,212 INFO L226 Difference]: Without dead ends: 141 [2019-10-13 21:33:59,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-13 21:33:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-13 21:33:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2019-10-13 21:33:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-13 21:33:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-10-13 21:33:59,232 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 79 [2019-10-13 21:33:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:59,232 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-10-13 21:33:59,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 21:33:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-10-13 21:33:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:33:59,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:59,235 INFO L380 BasicCegarLoop]: trace histogram [27, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:59,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:59,449 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1390226785, now seen corresponding path program 6 times [2019-10-13 21:33:59,449 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:59,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014763310] [2019-10-13 21:33:59,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:59,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:59,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-13 21:34:00,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014763310] [2019-10-13 21:34:00,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202899535] [2019-10-13 21:34:00,209 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:00,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:00,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:00,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:34:00,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-13 21:34:00,449 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-13 21:34:01,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [418845698] [2019-10-13 21:34:01,327 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:01,327 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:01,328 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:01,328 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:01,328 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:01,354 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:02,483 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:02,493 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:02,497 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:02,498 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:02,498 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:02,498 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:02,499 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:02,499 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:02,499 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,499 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,500 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,500 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:02,500 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:02,501 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:02,501 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:02,501 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,502 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:02,502 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,502 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:34:02,503 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:02,503 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,503 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:34:03,146 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:03,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 21:34:03,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525848333] [2019-10-13 21:34:03,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:34:03,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:34:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:34:03,150 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 69 states. [2019-10-13 21:34:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:06,359 INFO L93 Difference]: Finished difference Result 269 states and 311 transitions. [2019-10-13 21:34:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-13 21:34:06,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 128 [2019-10-13 21:34:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:06,362 INFO L225 Difference]: With dead ends: 269 [2019-10-13 21:34:06,362 INFO L226 Difference]: Without dead ends: 170 [2019-10-13 21:34:06,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-13 21:34:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-13 21:34:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2019-10-13 21:34:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-13 21:34:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2019-10-13 21:34:06,385 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 128 [2019-10-13 21:34:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:06,386 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2019-10-13 21:34:06,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:34:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2019-10-13 21:34:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:34:06,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:06,388 INFO L380 BasicCegarLoop]: trace histogram [56, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:06,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:06,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash -412242356, now seen corresponding path program 7 times [2019-10-13 21:34:06,594 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:06,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715266824] [2019-10-13 21:34:06,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:06,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:06,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-13 21:34:07,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715266824] [2019-10-13 21:34:07,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006115660] [2019-10-13 21:34:07,972 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:08,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:34:08,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-13 21:34:08,273 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-13 21:34:11,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69694793] [2019-10-13 21:34:11,727 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:34:11,727 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:11,727 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:11,728 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:11,728 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:11,752 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:12,757 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:12,978 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:12,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:12,989 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:12,989 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:12,989 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 346#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))))) [2019-10-13 21:34:12,989 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 331#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:12,989 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 351#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))))) [2019-10-13 21:34:12,989 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 360#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 283#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 336#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* main_~x~0 4) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 365#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:12,990 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:12,991 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:12,991 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 326#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:12,991 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 341#(exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))))) [2019-10-13 21:34:12,991 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 356#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))))))) [2019-10-13 21:34:12,991 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:12,991 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:34:13,565 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:13,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-13 21:34:13,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460180915] [2019-10-13 21:34:13,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-13 21:34:13,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:13,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-13 21:34:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-13 21:34:13,573 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 127 states.