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-crafted/mapsum1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:29:50,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:29:50,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:29:50,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:29:50,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:29:50,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:29:50,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:29:50,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:29:50,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:29:50,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:29:50,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:29:50,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:29:50,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:29:50,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:29:50,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:29:50,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:29:50,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:29:50,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:29:50,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:29:50,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:29:50,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:29:50,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:29:50,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:29:50,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:29:50,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:29:50,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:29:50,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:29:50,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:29:50,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:29:50,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:29:50,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:29:50,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:29:50,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:29:50,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:29:50,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:29:50,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:29:50,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:29:50,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:29:50,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:29:50,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:29:50,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:29:50,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:29:50,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:29:50,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:29:50,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:29:50,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:29:50,922 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:29:50,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:29:50,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:29:50,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:29:50,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:29:50,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:29:50,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:29:50,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:29:50,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:29:50,924 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:29:50,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:29:50,925 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:29:50,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:29:50,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:29:50,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:29:50,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:29:50,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:29:50,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:50,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:29:50,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:29:50,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:29:50,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:29:50,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:29:50,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:29:50,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:29:51,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:29:51,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:29:51,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:29:51,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:29:51,255 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:29:51,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum1.i [2019-10-15 01:29:51,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d9152c9/3b365c5fc06a4152b2c0d44d988f6b7c/FLAG08a0d45ab [2019-10-15 01:29:51,771 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:29:51,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum1.i [2019-10-15 01:29:51,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d9152c9/3b365c5fc06a4152b2c0d44d988f6b7c/FLAG08a0d45ab [2019-10-15 01:29:52,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d9152c9/3b365c5fc06a4152b2c0d44d988f6b7c [2019-10-15 01:29:52,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:29:52,155 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:29:52,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:52,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:29:52,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:29:52,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175279dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52, skipping insertion in model container [2019-10-15 01:29:52,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:29:52,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:29:52,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:52,418 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:29:52,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:29:52,452 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:29:52,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52 WrapperNode [2019-10-15 01:29:52,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:29:52,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:29:52,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:29:52,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:29:52,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... [2019-10-15 01:29:52,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:29:52,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:29:52,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:29:52,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:29:52,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:29:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:29:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:29:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-15 01:29:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:29:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:29:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:29:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-15 01:29:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:29:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:29:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:29:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:29:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:29:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:29:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:29:53,010 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:29:53,011 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:29:53,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:53 BoogieIcfgContainer [2019-10-15 01:29:53,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:29:53,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:29:53,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:29:53,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:29:53,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:29:52" (1/3) ... [2019-10-15 01:29:53,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:53, skipping insertion in model container [2019-10-15 01:29:53,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:29:52" (2/3) ... [2019-10-15 01:29:53,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aa758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:29:53, skipping insertion in model container [2019-10-15 01:29:53,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:29:53" (3/3) ... [2019-10-15 01:29:53,021 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum1.i [2019-10-15 01:29:53,031 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:29:53,041 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:29:53,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:29:53,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:29:53,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:29:53,083 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:29:53,083 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:29:53,083 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:29:53,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:29:53,083 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:29:53,083 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:29:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 01:29:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:29:53,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:53,110 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:53,112 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2002379581, now seen corresponding path program 1 times [2019-10-15 01:29:53,124 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:53,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923133230] [2019-10-15 01:29:53,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:53,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:53,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923133230] [2019-10-15 01:29:53,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:53,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:53,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585337216] [2019-10-15 01:29:53,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:53,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:53,355 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 01:29:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:53,400 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 01:29:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:53,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:29:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:53,416 INFO L225 Difference]: With dead ends: 41 [2019-10-15 01:29:53,416 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:29:53,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:29:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:29:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:29:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 01:29:53,468 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 01:29:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:53,468 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 01:29:53,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 01:29:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:29:53,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:53,471 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:53,472 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1641553888, now seen corresponding path program 1 times [2019-10-15 01:29:53,473 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:53,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442992843] [2019-10-15 01:29:53,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:53,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:53,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:53,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442992843] [2019-10-15 01:29:53,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441222049] [2019-10-15 01:29:53,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:53,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:53,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:53,710 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:29:53,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:53,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 01:29:53,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793109142] [2019-10-15 01:29:53,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:53,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:53,771 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 01:29:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:53,783 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 01:29:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:53,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:29:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:53,785 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:29:53,786 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:29:53,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:29:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:29:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:29:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:29:53,793 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 01:29:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:53,793 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:29:53,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:29:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:29:53,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:53,795 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:53,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:53,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1715048104, now seen corresponding path program 1 times [2019-10-15 01:29:54,001 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:54,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038405070] [2019-10-15 01:29:54,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:54,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:54,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:54,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038405070] [2019-10-15 01:29:54,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:54,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:54,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517670683] [2019-10-15 01:29:54,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:54,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:54,090 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 01:29:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:54,105 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 01:29:54,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:54,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 01:29:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:54,108 INFO L225 Difference]: With dead ends: 31 [2019-10-15 01:29:54,108 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 01:29:54,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 01:29:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 01:29:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:29:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 01:29:54,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 01:29:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:54,119 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 01:29:54,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 01:29:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:29:54,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:54,121 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:54,121 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1273676679, now seen corresponding path program 1 times [2019-10-15 01:29:54,122 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:54,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307772971] [2019-10-15 01:29:54,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:54,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:54,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:54,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307772971] [2019-10-15 01:29:54,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384543389] [2019-10-15 01:29:54,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:54,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:54,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:54,315 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:54,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573772282] [2019-10-15 01:29:54,385 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:54,385 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:54,391 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:54,398 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:54,399 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:54,583 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:56,632 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:29:56,695 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:56,700 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:29:57,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:29:57,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:29:57,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277913231] [2019-10-15 01:29:57,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:29:57,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:29:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:29:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:29:57,077 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 01:29:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:57,734 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 01:29:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:29:57,734 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 01:29:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:57,735 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:29:57,736 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 01:29:57,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:29:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 01:29:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 01:29:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:29:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 01:29:57,743 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 01:29:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:57,744 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 01:29:57,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:29:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 01:29:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:29:57,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:57,745 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:57,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:57,956 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:57,957 INFO L82 PathProgramCache]: Analyzing trace with hash 811678230, now seen corresponding path program 2 times [2019-10-15 01:29:57,957 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:29:57,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34063996] [2019-10-15 01:29:57,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:57,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:57,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:29:58,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34063996] [2019-10-15 01:29:58,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280012211] [2019-10-15 01:29:58,093 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 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-15 01:29:58,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:29:58,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:29:58,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:58,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:58,221 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:29:58,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082719819] [2019-10-15 01:29:58,256 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:29:58,257 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:29:58,259 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:29:58,259 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:29:58,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:29:58,296 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:29:59,884 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:29:59,926 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:29:59,930 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:00,326 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:00,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 01:30:00,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643285033] [2019-10-15 01:30:00,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:30:00,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:30:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:30:00,330 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 01:30:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:01,189 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 01:30:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:30:01,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 01:30:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:01,191 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:30:01,191 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:30:01,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:30:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:30:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:30:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:30:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 01:30:01,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 01:30:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:01,200 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 01:30:01,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:30:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 01:30:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:30:01,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:01,201 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:01,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:01,406 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2095262385, now seen corresponding path program 3 times [2019-10-15 01:30:01,407 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:01,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201249530] [2019-10-15 01:30:01,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:01,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:01,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:01,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201249530] [2019-10-15 01:30:01,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140322689] [2019-10-15 01:30:01,497 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 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-15 01:30:01,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:01,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:01,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:30:01,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:01,633 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:01,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1138454160] [2019-10-15 01:30:01,749 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:01,750 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:01,750 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:01,751 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:01,751 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:01,776 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:03,093 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:30:03,129 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:03,133 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:03,612 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:03,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 01:30:03,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078019241] [2019-10-15 01:30:03,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:30:03,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:03,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:30:03,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:03,617 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-15 01:30:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:04,601 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-15 01:30:04,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:30:04,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-15 01:30:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:04,602 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:30:04,602 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:30:04,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 01:30:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:30:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:30:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:30:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:30:04,612 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-15 01:30:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:04,612 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:30:04,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:30:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:30:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:30:04,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:04,614 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:04,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:04,819 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2049115666, now seen corresponding path program 4 times [2019-10-15 01:30:04,820 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:04,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581269223] [2019-10-15 01:30:04,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:04,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:04,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:05,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581269223] [2019-10-15 01:30:05,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410891819] [2019-10-15 01:30:05,031 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 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-15 01:30:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:05,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 01:30:05,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:05,191 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:05,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984443511] [2019-10-15 01:30:05,491 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:05,491 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:05,491 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:05,491 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:05,492 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:05,508 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:06,660 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:30:06,685 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:06,688 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:07,086 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:07,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-15 01:30:07,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278268531] [2019-10-15 01:30:07,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-15 01:30:07,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-15 01:30:07,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 01:30:07,091 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 40 states. [2019-10-15 01:30:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:08,671 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2019-10-15 01:30:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 01:30:08,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2019-10-15 01:30:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:08,673 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:30:08,673 INFO L226 Difference]: Without dead ends: 50 [2019-10-15 01:30:08,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1244, Invalid=4158, Unknown=0, NotChecked=0, Total=5402 [2019-10-15 01:30:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-15 01:30:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-15 01:30:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 01:30:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-15 01:30:08,685 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2019-10-15 01:30:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:08,685 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-15 01:30:08,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-15 01:30:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-15 01:30:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:30:08,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:08,688 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:08,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:08,894 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash -740285582, now seen corresponding path program 5 times [2019-10-15 01:30:08,894 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:08,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449428215] [2019-10-15 01:30:08,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:08,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:08,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 01:30:09,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449428215] [2019-10-15 01:30:09,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407905786] [2019-10-15 01:30:09,315 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 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-15 01:30:09,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:09,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:09,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:30:09,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-15 01:30:09,569 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-15 01:30:09,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183262670] [2019-10-15 01:30:09,610 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:09,610 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:09,610 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:09,610 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:09,611 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:09,623 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:10,852 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:30:10,875 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:10,877 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:11,347 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:11,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-15 01:30:11,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454813552] [2019-10-15 01:30:11,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-15 01:30:11,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-15 01:30:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:11,351 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 44 states. [2019-10-15 01:30:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:13,310 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-15 01:30:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-15 01:30:13,310 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-10-15 01:30:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:13,312 INFO L225 Difference]: With dead ends: 72 [2019-10-15 01:30:13,312 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:30:13,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-15 01:30:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:30:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-15 01:30:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:30:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 01:30:13,323 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 63 [2019-10-15 01:30:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:13,323 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 01:30:13,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-15 01:30:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 01:30:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:30:13,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:13,325 INFO L380 BasicCegarLoop]: trace histogram [27, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:13,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:13,529 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1983049792, now seen corresponding path program 6 times [2019-10-15 01:30:13,530 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:13,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859574874] [2019-10-15 01:30:13,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:13,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:13,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:13,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859574874] [2019-10-15 01:30:13,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617053346] [2019-10-15 01:30:13,997 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 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-15 01:30:14,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:14,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:14,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:30:14,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:14,251 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:15,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [279737460] [2019-10-15 01:30:15,183 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:15,183 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:15,184 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:15,184 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:15,184 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:15,199 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:16,425 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:30:16,451 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:16,454 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:17,016 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:17,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-15 01:30:17,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699855132] [2019-10-15 01:30:17,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-15 01:30:17,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-15 01:30:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=3090, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:30:17,021 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 70 states. [2019-10-15 01:30:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:20,465 INFO L93 Difference]: Finished difference Result 104 states and 140 transitions. [2019-10-15 01:30:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-15 01:30:20,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 67 [2019-10-15 01:30:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:20,467 INFO L225 Difference]: With dead ends: 104 [2019-10-15 01:30:20,467 INFO L226 Difference]: Without dead ends: 83 [2019-10-15 01:30:20,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3929 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5099, Invalid=12723, Unknown=0, NotChecked=0, Total=17822 [2019-10-15 01:30:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-15 01:30:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-15 01:30:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:30:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-10-15 01:30:20,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2019-10-15 01:30:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:20,482 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-10-15 01:30:20,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-15 01:30:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-10-15 01:30:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:30:20,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:20,484 INFO L380 BasicCegarLoop]: trace histogram [56, 12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:20,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:20,688 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1441308797, now seen corresponding path program 7 times [2019-10-15 01:30:20,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:20,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062572855] [2019-10-15 01:30:20,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:20,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:20,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:22,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062572855] [2019-10-15 01:30:22,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180861202] [2019-10-15 01:30:22,039 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:22,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-15 01:30:22,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:22,338 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-15 01:30:25,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [868775158] [2019-10-15 01:30:25,262 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 01:30:25,262 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:25,263 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:25,263 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:25,263 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:25,280 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:30:26,532 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-15 01:30:26,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:30:26,562 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:27,315 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:27,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 113 [2019-10-15 01:30:27,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506099216] [2019-10-15 01:30:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-10-15 01:30:27,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-10-15 01:30:27,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5282, Invalid=7600, Unknown=0, NotChecked=0, Total=12882 [2019-10-15 01:30:27,322 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 114 states.