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-multidimensional/copy-partial-2-n-u.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:37:23,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:37:23,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:37:23,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:37:23,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:37:23,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:37:23,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:37:23,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:37:23,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:37:23,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:37:23,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:37:23,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:37:23,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:37:23,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:37:23,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:37:23,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:37:23,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:37:23,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:37:23,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:37:23,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:37:23,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:37:23,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:37:23,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:37:23,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:37:23,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:37:23,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:37:23,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:37:23,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:37:23,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:37:23,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:37:23,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:37:23,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:37:23,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:37:23,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:37:23,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:37:23,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:37:23,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:37:23,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:37:23,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:37:23,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:37:23,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:37:23,940 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:37:23,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:37:23,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:37:23,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:37:23,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:37:23,956 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:37:23,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:37:23,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:37:23,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:37:23,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:37:23,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:37:23,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:37:23,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:37:23,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:37:23,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:37:23,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:37:23,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:37:23,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:37:23,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:37:23,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:37:23,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:37:23,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:37:23,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:37:23,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:37:23,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:37:23,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:37:23,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:37:23,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:37:23,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:37:23,961 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:37:24,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:37:24,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:37:24,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:37:24,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:37:24,261 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:37:24,261 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u.c [2019-10-13 21:37:24,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f59dd248/54010eb7638e416db0515866fc2165b6/FLAGb17116dad [2019-10-13 21:37:24,757 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:37:24,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u.c [2019-10-13 21:37:24,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f59dd248/54010eb7638e416db0515866fc2165b6/FLAGb17116dad [2019-10-13 21:37:25,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f59dd248/54010eb7638e416db0515866fc2165b6 [2019-10-13 21:37:25,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:37:25,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:37:25,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:37:25,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:37:25,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:37:25,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1905c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25, skipping insertion in model container [2019-10-13 21:37:25,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,203 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:37:25,221 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:37:25,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:37:25,399 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:37:25,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:37:25,443 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:37:25,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25 WrapperNode [2019-10-13 21:37:25,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:37:25,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:37:25,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:37:25,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:37:25,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... [2019-10-13 21:37:25,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:37:25,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:37:25,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:37:25,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:37:25,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:37:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:37:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:37:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:37:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:37:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:37:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:37:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:37:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:37:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:37:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:37:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:37:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:37:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:37:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:37:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:37:26,014 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:37:26,015 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 21:37:26,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:37:26 BoogieIcfgContainer [2019-10-13 21:37:26,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:37:26,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:37:26,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:37:26,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:37:26,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:37:25" (1/3) ... [2019-10-13 21:37:26,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b971a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:37:26, skipping insertion in model container [2019-10-13 21:37:26,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:37:25" (2/3) ... [2019-10-13 21:37:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b971a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:37:26, skipping insertion in model container [2019-10-13 21:37:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:37:26" (3/3) ... [2019-10-13 21:37:26,023 INFO L109 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u.c [2019-10-13 21:37:26,033 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:37:26,041 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:37:26,052 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:37:26,075 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:37:26,075 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:37:26,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:37:26,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:37:26,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:37:26,076 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:37:26,076 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:37:26,076 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:37:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:37:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:37:26,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:26,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:26,102 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 357994483, now seen corresponding path program 1 times [2019-10-13 21:37:26,117 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:26,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953481139] [2019-10-13 21:37:26,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:26,202 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:26,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980415120] [2019-10-13 21:37:26,203 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:37:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:26,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:37:26,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:26,339 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:37:26,339 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:26,374 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:37:26,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953481139] [2019-10-13 21:37:26,377 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:26,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980415120] [2019-10-13 21:37:26,379 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:37:26,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-13 21:37:26,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841742448] [2019-10-13 21:37:26,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:37:26,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:37:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:37:26,400 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-10-13 21:37:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:26,466 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2019-10-13 21:37:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:37:26,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:37:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:26,482 INFO L225 Difference]: With dead ends: 40 [2019-10-13 21:37:26,482 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:37:26,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:37:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:37:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:37:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:37:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-13 21:37:26,525 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2019-10-13 21:37:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:26,526 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-13 21:37:26,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:37:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-13 21:37:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:37:26,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:26,527 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:26,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:26,732 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash -964628371, now seen corresponding path program 1 times [2019-10-13 21:37:26,734 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:26,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488539057] [2019-10-13 21:37:26,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:26,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:26,745 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:26,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868581317] [2019-10-13 21:37:26,745 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-13 21:37:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:26,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:37:26,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:26,822 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:37:26,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488539057] [2019-10-13 21:37:26,843 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:26,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868581317] [2019-10-13 21:37:26,844 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:37:26,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-13 21:37:26,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436208739] [2019-10-13 21:37:26,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:37:26,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:37:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:37:26,847 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 6 states. [2019-10-13 21:37:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:26,966 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2019-10-13 21:37:26,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:37:26,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 21:37:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:26,971 INFO L225 Difference]: With dead ends: 53 [2019-10-13 21:37:26,971 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:37:26,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:37:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:37:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-10-13 21:37:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:37:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-13 21:37:26,987 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-10-13 21:37:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:26,988 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-13 21:37:26,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:37:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-13 21:37:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:37:26,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:26,989 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:27,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:27,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1384779757, now seen corresponding path program 1 times [2019-10-13 21:37:27,204 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:27,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899433762] [2019-10-13 21:37:27,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:27,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:27,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:27,215 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:27,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036815719] [2019-10-13 21:37:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:37:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:27,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:37:27,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:27,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:37:27,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899433762] [2019-10-13 21:37:27,398 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:27,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036815719] [2019-10-13 21:37:27,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [572590409] [2019-10-13 21:37:27,434 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:37:27,434 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:27,440 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:27,446 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:27,447 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:27,597 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:28,227 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:37:28,237 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:28,245 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:28,245 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:28,246 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 123#(and (<= 0 main_~j~0) (<= main_~q~0 0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:28,246 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 195#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:28,246 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 128#(and (<= 0 main_~j~0) (<= main_~q~0 0) (<= 0 main_~q~0) (<= 0 main_~i~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:28,247 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:28,248 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 181#false [2019-10-13 21:37:28,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 191#false [2019-10-13 21:37:28,248 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:37:28,249 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:37:28,249 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 172#(<= 0 main_~j~0) [2019-10-13 21:37:28,249 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 200#(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:37:28,249 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 118#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:28,250 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:28,250 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 133#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~i~0 0) (<= main_~q~0 0) (< main_~j~0 main_~s~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:28,254 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 186#false [2019-10-13 21:37:28,254 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 176#false [2019-10-13 21:37:28,590 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:28,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:37:28,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 6] total 18 [2019-10-13 21:37:28,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470345500] [2019-10-13 21:37:28,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:37:28,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:37:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:37:28,671 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 10 states. [2019-10-13 21:37:28,900 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-10-13 21:37:29,111 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-13 21:37:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:29,280 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-10-13 21:37:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:37:29,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-13 21:37:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:29,282 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:37:29,285 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:37:29,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:37:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:37:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-10-13 21:37:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 21:37:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-10-13 21:37:29,302 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2019-10-13 21:37:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:29,303 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-13 21:37:29,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:37:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-10-13 21:37:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:37:29,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:29,305 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:29,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:29,509 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash -843921470, now seen corresponding path program 1 times [2019-10-13 21:37:29,510 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:29,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179378178] [2019-10-13 21:37:29,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:29,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:29,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:29,532 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:29,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255423513] [2019-10-13 21:37:29,532 INFO L94 rtionOrderModulation]: Keeping assertion order 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:37:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:29,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:37:29,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:37:29,623 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:37:29,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179378178] [2019-10-13 21:37:29,659 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:29,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255423513] [2019-10-13 21:37:29,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1721570920] [2019-10-13 21:37:29,661 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:37:29,661 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:29,661 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:29,662 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:29,662 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:29,706 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:30,218 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:37:30,223 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:30,229 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:30,230 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:30,232 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 188#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (or (and (<= 0 main_~q~0) (= main_~j~0 0) (<= main_~s~0 0) (= main_~i~0 0)) (and (<= main_~q~0 0) (= main_~j~0 0) (= main_~i~0 0))) (<= main_~i~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:30,233 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 265#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:30,233 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 193#(and (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (or (and (<= main_~q~0 0) (<= 0 main_~q~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~s~0 0) (= main_~i~0 0)))) [2019-10-13 21:37:30,233 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:30,233 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 251#false [2019-10-13 21:37:30,234 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 261#false [2019-10-13 21:37:30,234 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:37:30,234 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:37:30,235 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 242#(<= 0 main_~j~0) [2019-10-13 21:37:30,235 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 174#(and (or (and (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~s~0)) (= main_~j~0 0))) (or (and (<= 0 main_~j~0) (<= main_~j~0 0) (<= main_~s~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)))) [2019-10-13 21:37:30,235 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 270#(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:37:30,235 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 204#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~s~0 0) (<= main_~i~0 0) (< main_~j~0 main_~s~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:30,236 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:30,236 INFO L193 IcfgInterpreter]: Reachable states at location L42-2 satisfy 169#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:30,236 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 256#false [2019-10-13 21:37:30,237 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 246#false [2019-10-13 21:37:30,491 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:30,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:37:30,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 6] total 20 [2019-10-13 21:37:30,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099613493] [2019-10-13 21:37:30,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:37:30,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:37:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:37:30,702 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 12 states. [2019-10-13 21:37:30,937 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-13 21:37:31,122 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-13 21:37:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:31,500 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-10-13 21:37:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:37:31,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-10-13 21:37:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:31,502 INFO L225 Difference]: With dead ends: 46 [2019-10-13 21:37:31,502 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:37:31,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:37:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:37:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-10-13 21:37:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 21:37:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-10-13 21:37:31,523 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 23 [2019-10-13 21:37:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:31,524 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-10-13 21:37:31,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:37:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-10-13 21:37:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:37:31,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:31,525 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:31,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:31,729 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:31,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1976738209, now seen corresponding path program 1 times [2019-10-13 21:37:31,730 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:31,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125174945] [2019-10-13 21:37:31,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:31,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:31,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:31,739 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:31,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925189804] [2019-10-13 21:37:31,739 INFO L94 rtionOrderModulation]: Keeping assertion order 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-13 21:37:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:31,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:37:31,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:37:31,835 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:37:31,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125174945] [2019-10-13 21:37:31,873 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:31,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925189804] [2019-10-13 21:37:31,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [910414199] [2019-10-13 21:37:31,876 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:37:31,876 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:31,877 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:31,877 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:31,877 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:31,900 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:32,318 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:37:32,327 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:32,332 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:32,332 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:32,332 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 195#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (or (and (<= 0 main_~q~0) (= main_~j~0 0) (= main_~i~0 0)) (and (<= main_~q~0 0) (= main_~j~0 0) (= main_~i~0 0))) (<= main_~i~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:32,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 272#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:32,333 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 200#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:32,333 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:32,333 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 258#(and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (v_prenex_1 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) |v_main_~#B~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:32,333 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 268#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (v_prenex_1 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) |v_main_~#B~0.offset_BEFORE_CALL_3|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:32,334 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:37:32,335 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:37:32,335 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 249#(<= 0 main_~j~0) [2019-10-13 21:37:32,335 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 181#(and (or (and (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~s~0)))) (<= 0 main_~j~0)) [2019-10-13 21:37:32,335 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 277#(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:37:32,336 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 211#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (< main_~j~0 main_~s~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (< main_~i~0 main_~q~0) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:32,336 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:32,336 INFO L193 IcfgInterpreter]: Reachable states at location L42-2 satisfy 176#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0)) [2019-10-13 21:37:32,336 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 263#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (v_prenex_1 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) |v_main_~#B~0.offset_BEFORE_CALL_3|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:32,336 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 253#(exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (v_prenex_1 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) |v_main_~#B~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:37:32,647 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:32,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:37:32,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 14] total 24 [2019-10-13 21:37:32,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433847342] [2019-10-13 21:37:32,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 21:37:32,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:32,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 21:37:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:37:32,913 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 24 states. [2019-10-13 21:37:33,206 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-13 21:37:33,624 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-13 21:37:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:34,974 INFO L93 Difference]: Finished difference Result 112 states and 164 transitions. [2019-10-13 21:37:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:37:34,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-10-13 21:37:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:34,976 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:37:34,976 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 21:37:34,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=475, Invalid=1687, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:37:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 21:37:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 39. [2019-10-13 21:37:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:37:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-13 21:37:34,991 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 24 [2019-10-13 21:37:34,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:34,991 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-13 21:37:34,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 21:37:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-13 21:37:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:37:34,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:34,993 INFO L380 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:35,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:35,206 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:35,207 INFO L82 PathProgramCache]: Analyzing trace with hash -743084193, now seen corresponding path program 2 times [2019-10-13 21:37:35,208 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:35,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165983533] [2019-10-13 21:37:35,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:35,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:35,218 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:35,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2095553430] [2019-10-13 21:37:35,218 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-13 21:37:35,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:37:35,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:35,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:37:35,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-13 21:37:35,391 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-13 21:37:35,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165983533] [2019-10-13 21:37:35,466 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:35,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095553430] [2019-10-13 21:37:35,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2025528567] [2019-10-13 21:37:35,469 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:37:35,470 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:35,472 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:35,473 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:35,473 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:35,502 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:35,901 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:37:35,909 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:35,912 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:35,913 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:35,913 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 195#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (or (and (<= 0 main_~q~0) (= main_~j~0 0) (= main_~i~0 0)) (and (<= main_~q~0 0) (= main_~j~0 0) (= main_~i~0 0))) (<= main_~i~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:35,913 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 272#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:35,913 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 200#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:35,913 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:35,914 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 258#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#B~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_6) v_prenex_8) (select (select |#memory_int| v_prenex_5) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) |v_main_~#B~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:35,914 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 268#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#B~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_6) v_prenex_8) (select (select |#memory_int| v_prenex_5) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) |v_main_~#B~0.offset_BEFORE_CALL_4|)))))) (<= __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:37:35,914 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:37:35,914 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:37:35,915 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 249#(<= 0 main_~j~0) [2019-10-13 21:37:35,915 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 181#(and (or (and (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~s~0)))) (<= 0 main_~j~0)) [2019-10-13 21:37:35,915 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 277#(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:37:35,916 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 211#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (< main_~j~0 main_~s~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (< main_~i~0 main_~q~0) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:35,916 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:35,916 INFO L193 IcfgInterpreter]: Reachable states at location L42-2 satisfy 176#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0)) [2019-10-13 21:37:35,916 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 263#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#B~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_6) v_prenex_8) (select (select |#memory_int| v_prenex_5) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) |v_main_~#B~0.offset_BEFORE_CALL_4|)))))) (<= __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:37:35,916 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 253#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#B~0.offset_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_6) v_prenex_8) (select (select |#memory_int| v_prenex_5) v_prenex_7))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) |v_main_~#B~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:37:36,202 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:36,470 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:37:36,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14] total 22 [2019-10-13 21:37:36,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223216539] [2019-10-13 21:37:36,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:37:36,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:37:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:37:36,473 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 22 states. [2019-10-13 21:37:36,693 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-13 21:37:36,918 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-13 21:37:37,136 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-13 21:37:37,736 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-13 21:37:38,288 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-13 21:37:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:38,501 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2019-10-13 21:37:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:37:38,501 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 21:37:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:38,504 INFO L225 Difference]: With dead ends: 108 [2019-10-13 21:37:38,504 INFO L226 Difference]: Without dead ends: 96 [2019-10-13 21:37:38,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 21:37:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-13 21:37:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 51. [2019-10-13 21:37:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-13 21:37:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-10-13 21:37:38,520 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 32 [2019-10-13 21:37:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:38,520 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-10-13 21:37:38,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:37:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-10-13 21:37:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:37:38,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:38,522 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:38,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:38,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:38,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1700125282, now seen corresponding path program 3 times [2019-10-13 21:37:38,736 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:38,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006040148] [2019-10-13 21:37:38,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:38,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:38,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:38,742 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:38,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427314324] [2019-10-13 21:37:38,743 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-13 21:37:38,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:37:38,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:38,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:37:38,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-13 21:37:38,840 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-13 21:37:38,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006040148] [2019-10-13 21:37:38,869 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:38,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427314324] [2019-10-13 21:37:38,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393851858] [2019-10-13 21:37:38,871 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:37:38,871 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:38,871 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:38,872 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:38,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:38,890 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:39,203 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:37:39,209 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:39,211 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:39,211 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:39,212 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 195#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (or (and (<= 0 main_~q~0) (= main_~j~0 0) (= main_~i~0 0)) (and (<= main_~q~0 0) (= main_~j~0 0) (= main_~i~0 0))) (<= main_~i~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:39,212 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 272#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:39,212 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 200#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:39,212 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:39,212 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 258#(and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#B~0.offset_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) |v_main_~#B~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:39,213 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 268#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#B~0.offset_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) |v_main_~#B~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (<= 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:37:39,213 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:37:39,213 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:37:39,213 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 249#(<= 0 main_~j~0) [2019-10-13 21:37:39,214 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 181#(and (or (and (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~s~0)))) (<= 0 main_~j~0)) [2019-10-13 21:37:39,214 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 277#(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:37:39,214 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 211#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (< main_~j~0 main_~s~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (< main_~i~0 main_~q~0) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:39,214 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:39,214 INFO L193 IcfgInterpreter]: Reachable states at location L42-2 satisfy 176#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0)) [2019-10-13 21:37:39,214 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 263#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#B~0.offset_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) |v_main_~#B~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (<= 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:37:39,215 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 253#(exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#B~0.offset_BEFORE_CALL_5| Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) |v_main_~#B~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:37:39,488 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:39,738 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:37:39,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14] total 19 [2019-10-13 21:37:39,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401230695] [2019-10-13 21:37:39,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:37:39,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:37:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:37:39,740 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 19 states. [2019-10-13 21:37:39,947 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-13 21:37:40,236 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-13 21:37:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:40,844 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2019-10-13 21:37:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:37:40,845 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-10-13 21:37:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:40,846 INFO L225 Difference]: With dead ends: 83 [2019-10-13 21:37:40,846 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 21:37:40,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:37:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 21:37:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-10-13 21:37:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:37:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-10-13 21:37:40,859 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 38 [2019-10-13 21:37:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:40,859 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-10-13 21:37:40,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:37:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-10-13 21:37:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:37:40,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:40,861 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:41,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:41,071 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1043215469, now seen corresponding path program 4 times [2019-10-13 21:37:41,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:41,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128703707] [2019-10-13 21:37:41,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:41,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:41,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:41,078 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:41,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666264401] [2019-10-13 21:37:41,078 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-13 21:37:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:41,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:37:41,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-13 21:37:41,225 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-13 21:37:41,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128703707] [2019-10-13 21:37:41,311 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:41,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666264401] [2019-10-13 21:37:41,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480850476] [2019-10-13 21:37:41,314 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:37:41,314 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:41,315 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:41,315 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:41,315 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:41,335 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:41,628 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:37:41,649 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:41,652 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:41,652 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:41,652 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 195#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (or (and (<= 0 main_~q~0) (= main_~j~0 0) (= main_~i~0 0)) (and (<= main_~q~0 0) (= main_~j~0 0) (= main_~i~0 0))) (<= main_~i~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:41,652 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 272#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:41,653 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 200#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:41,653 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:41,653 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 258#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int) (|v_main_~#B~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) |v_main_~#B~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:41,653 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 268#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int) (|v_main_~#B~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) |v_main_~#B~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:41,653 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:37:41,654 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:37:41,654 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 249#(<= 0 main_~j~0) [2019-10-13 21:37:41,654 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 181#(and (or (and (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~s~0)))) (<= 0 main_~j~0)) [2019-10-13 21:37:41,654 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 277#(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:37:41,654 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 211#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (< main_~j~0 main_~s~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (< main_~i~0 main_~q~0) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:41,655 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:41,655 INFO L193 IcfgInterpreter]: Reachable states at location L42-2 satisfy 176#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0)) [2019-10-13 21:37:41,655 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 263#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int) (|v_main_~#B~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) |v_main_~#B~0.offset_BEFORE_CALL_6|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:41,655 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 253#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int) (|v_main_~#B~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) |v_main_~#B~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:37:41,928 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:42,162 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:37:42,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 14] total 32 [2019-10-13 21:37:42,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958302949] [2019-10-13 21:37:42,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:37:42,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:37:42,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:37:42,165 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 32 states. [2019-10-13 21:37:42,432 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-13 21:37:43,201 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-13 21:37:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:45,515 INFO L93 Difference]: Finished difference Result 263 states and 388 transitions. [2019-10-13 21:37:45,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-13 21:37:45,516 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2019-10-13 21:37:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:45,518 INFO L225 Difference]: With dead ends: 263 [2019-10-13 21:37:45,518 INFO L226 Difference]: Without dead ends: 230 [2019-10-13 21:37:45,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1164, Invalid=3666, Unknown=0, NotChecked=0, Total=4830 [2019-10-13 21:37:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-13 21:37:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 62. [2019-10-13 21:37:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 21:37:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-10-13 21:37:45,541 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 41 [2019-10-13 21:37:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:45,541 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-10-13 21:37:45,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:37:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-10-13 21:37:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:37:45,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:45,543 INFO L380 BasicCegarLoop]: trace histogram [28, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:45,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:45,748 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash -269381011, now seen corresponding path program 5 times [2019-10-13 21:37:45,749 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:45,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102980779] [2019-10-13 21:37:45,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:45,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:45,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:45,756 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:45,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471417282] [2019-10-13 21:37:45,757 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:45,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:37:45,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:45,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:37:45,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:37:45,896 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:37:45,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102980779] [2019-10-13 21:37:45,938 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:37:45,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471417282] [2019-10-13 21:37:45,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757159694] [2019-10-13 21:37:45,940 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:37:45,940 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:45,941 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:45,941 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:45,941 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:45,958 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:46,233 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:37:46,239 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:46,241 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:46,241 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:46,241 INFO L193 IcfgInterpreter]: Reachable states at location L56-2 satisfy 186#(and (and (= main_~j~0 0) (= main_~i~0 0)) (or (and (<= 0 main_~j~0) (<= main_~q~0 0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (<= main_~i~0 0) (<= main_~j~0 0)))) [2019-10-13 21:37:46,241 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 263#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:46,242 INFO L193 IcfgInterpreter]: Reachable states at location L58-2 satisfy 191#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0) (< main_~i~0 main_~q~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:46,242 INFO L193 IcfgInterpreter]: Reachable states at location L27-2 satisfy 113#(or (and (= main_~n~0 1500) (= 0 |#NULL.base|) (= main_~s~0 700) (< main_~q~0 main_~m~0) (<= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (not (= 0 |main_~#A~0.base|)) (< main_~s~0 main_~n~0) (= main_~q~0 500) (= main_~j~0 0) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= main_~m~0 1000) (= |#NULL.offset| 0) (= |#length| (store (store |old(#length)| |main_~#A~0.base| (* (* main_~n~0 4) main_~m~0)) |main_~#B~0.base| (* (* main_~n~0 4) main_~m~0))) (= main_~i~0 0)) (not (< main_~j~0 main_~n~0))) [2019-10-13 21:37:46,242 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 249#(and (exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#B~0.offset_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_17) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_20)))) (and (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) |v_main_~#B~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) |v_main_~#A~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:46,242 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 259#(and (exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#B~0.offset_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_17) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_20)))) (and (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) |v_main_~#B~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) |v_main_~#A~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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:37:46,242 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:37:46,243 INFO L193 IcfgInterpreter]: Reachable states at location L29-2 satisfy 240#(<= 0 main_~j~0) [2019-10-13 21:37:46,243 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:37:46,243 INFO L193 IcfgInterpreter]: Reachable states at location L40-2 satisfy 181#(and (or (and (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 0 main_~q~0) (<= 1 main_~i~0) (not (< main_~j~0 main_~s~0)))) (<= 0 main_~j~0)) [2019-10-13 21:37:46,243 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 268#(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:37:46,243 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:46,244 INFO L193 IcfgInterpreter]: Reachable states at location L60 satisfy 202#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (< main_~j~0 main_~s~0) (<= 0 main_~i~0) (<= 0 main_~s~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#A~0.offset|))) (< main_~i~0 main_~q~0) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#B~0.base|) (+ (* main_~i~0 (* main_~n~0 4)) (* main_~j~0 4) |main_~#B~0.offset|)) |main_#t~mem4|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-13 21:37:46,244 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 254#(and (exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#B~0.offset_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_17) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_20)))) (and (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) |v_main_~#B~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) |v_main_~#A~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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:37:46,244 INFO L193 IcfgInterpreter]: Reachable states at location L42-2 satisfy 176#(and (<= 0 main_~j~0) (<= 0 main_~q~0) (<= 0 main_~i~0)) [2019-10-13 21:37:46,244 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 244#(exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int) (|v_main_~#B~0.offset_BEFORE_CALL_7| Int) (|v_main_~#A~0.offset_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_17) v_prenex_19) (select (select |#memory_int| v_prenex_18) v_prenex_20)))) (and (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) |v_main_~#B~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) |v_main_~#A~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:37:46,512 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-13 21:37:46,766 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:37:46,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14] total 22 [2019-10-13 21:37:46,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7649206] [2019-10-13 21:37:46,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:37:46,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:37:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:37:46,768 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 22 states. [2019-10-13 21:37:46,978 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-13 21:37:47,296 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-13 21:37:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:47,952 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2019-10-13 21:37:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:37:47,953 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-10-13 21:37:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:47,954 INFO L225 Difference]: With dead ends: 114 [2019-10-13 21:37:47,955 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 21:37:47,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=268, Invalid=1064, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:37:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 21:37:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-10-13 21:37:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-13 21:37:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-10-13 21:37:47,978 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 57 [2019-10-13 21:37:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:47,979 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-10-13 21:37:47,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:37:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-10-13 21:37:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 21:37:47,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:47,980 INFO L380 BasicCegarLoop]: trace histogram [28, 16, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:48,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:48,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1266040127, now seen corresponding path program 6 times [2019-10-13 21:37:48,185 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:48,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409791422] [2019-10-13 21:37:48,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:48,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:48,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:48,193 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:37:48,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34309752] [2019-10-13 21:37:48,194 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:53,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:37:53,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:53,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-13 21:37:53,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:54,236 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 82 [2019-10-13 21:37:54,715 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 101 [2019-10-13 21:37:55,372 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 123 [2019-10-13 21:37:55,504 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 60 [2019-10-13 21:37:56,204 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 145 [2019-10-13 21:37:56,353 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2019-10-13 21:37:58,121 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 369 DAG size of output: 273 [2019-10-13 21:37:58,557 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 75 [2019-10-13 21:38:00,789 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 449 DAG size of output: 312 [2019-10-13 21:38:01,314 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 80 [2019-10-13 21:38:04,106 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 537 DAG size of output: 351 [2019-10-13 21:38:04,694 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 87 [2019-10-13 21:38:06,426 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 618 DAG size of output: 239 [2019-10-13 21:38:06,688 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 74