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/reducercommutativity/sep05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:20:35,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:20:35,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:20:35,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:20:35,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:20:35,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:20:35,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:20:35,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:20:35,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:20:35,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:20:35,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:20:35,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:20:35,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:20:35,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:20:35,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:20:35,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:20:35,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:20:35,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:20:35,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:20:35,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:20:35,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:20:35,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:20:35,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:20:35,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:20:35,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:20:35,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:20:35,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:20:35,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:20:35,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:20:35,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:20:35,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:20:35,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:20:35,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:20:35,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:20:35,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:20:35,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:20:35,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:20:35,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:20:35,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:20:35,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:20:35,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:20:35,314 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 23:20:35,336 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:20:35,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:20:35,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:20:35,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:20:35,338 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:20:35,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:20:35,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:20:35,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:20:35,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:20:35,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:20:35,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:20:35,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:20:35,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:20:35,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:20:35,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:20:35,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:20:35,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:20:35,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:20:35,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:20:35,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:20:35,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:20:35,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:20:35,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:20:35,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:20:35,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:20:35,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:20:35,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:20:35,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:20:35,344 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 23:20:35,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:20:35,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:20:35,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:20:35,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:20:35,621 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:20:35,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep05-1.i [2019-10-13 23:20:35,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a760c457/fb36c2952e344942bb1e74ba85437b1c/FLAG3ebd8657f [2019-10-13 23:20:36,110 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:20:36,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep05-1.i [2019-10-13 23:20:36,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a760c457/fb36c2952e344942bb1e74ba85437b1c/FLAG3ebd8657f [2019-10-13 23:20:36,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a760c457/fb36c2952e344942bb1e74ba85437b1c [2019-10-13 23:20:36,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:20:36,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:20:36,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:36,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:20:36,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:20:36,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b66671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36, skipping insertion in model container [2019-10-13 23:20:36,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:20:36,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:20:36,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:36,737 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:20:36,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:36,865 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:20:36,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36 WrapperNode [2019-10-13 23:20:36,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:36,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:20:36,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:20:36,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:20:36,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... [2019-10-13 23:20:36,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:20:36,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:20:36,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:20:36,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:20:36,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:20:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:20:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:20:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-10-13 23:20:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:20:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:20:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:20:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-10-13 23:20:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 23:20:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:20:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 23:20:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 23:20:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 23:20:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:20:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:20:37,385 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:20:37,385 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 23:20:37,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:37 BoogieIcfgContainer [2019-10-13 23:20:37,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:20:37,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:20:37,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:20:37,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:20:37,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:20:36" (1/3) ... [2019-10-13 23:20:37,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594e350e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:37, skipping insertion in model container [2019-10-13 23:20:37,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:36" (2/3) ... [2019-10-13 23:20:37,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594e350e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:37, skipping insertion in model container [2019-10-13 23:20:37,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:37" (3/3) ... [2019-10-13 23:20:37,394 INFO L109 eAbstractionObserver]: Analyzing ICFG sep05-1.i [2019-10-13 23:20:37,403 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:20:37,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:20:37,422 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:20:37,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:20:37,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:20:37,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:20:37,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:20:37,446 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:20:37,446 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:20:37,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:20:37,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:20:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 23:20:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:20:37,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:37,467 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:37,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1553264816, now seen corresponding path program 1 times [2019-10-13 23:20:37,480 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:37,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950189378] [2019-10-13 23:20:37,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:37,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:37,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:20:37,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950189378] [2019-10-13 23:20:37,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:37,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:37,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027373173] [2019-10-13 23:20:37,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:37,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:37,664 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 23:20:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:37,695 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-13 23:20:37,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:37,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:20:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:37,711 INFO L225 Difference]: With dead ends: 41 [2019-10-13 23:20:37,711 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 23:20:37,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 23:20:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 23:20:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 23:20:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 23:20:37,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-13 23:20:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:37,759 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 23:20:37,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 23:20:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 23:20:37,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:37,762 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:37,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1274606805, now seen corresponding path program 1 times [2019-10-13 23:20:37,763 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:37,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429757135] [2019-10-13 23:20:37,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:37,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:37,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:37,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429757135] [2019-10-13 23:20:37,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47780702] [2019-10-13 23:20:37,832 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 23:20:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:37,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:20:37,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:37,948 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:37,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:20:37,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-13 23:20:37,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617057007] [2019-10-13 23:20:37,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:37,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:37,985 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 23:20:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:38,009 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-13 23:20:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:38,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 23:20:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:38,012 INFO L225 Difference]: With dead ends: 33 [2019-10-13 23:20:38,013 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 23:20:38,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 23:20:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 23:20:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 23:20:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 23:20:38,025 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 23:20:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:38,026 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 23:20:38,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 23:20:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:20:38,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:38,029 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:38,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:38,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:38,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:38,241 INFO L82 PathProgramCache]: Analyzing trace with hash -544560989, now seen corresponding path program 1 times [2019-10-13 23:20:38,241 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:38,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950491750] [2019-10-13 23:20:38,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:38,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:38,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:38,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950491750] [2019-10-13 23:20:38,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:38,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:38,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902978225] [2019-10-13 23:20:38,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:38,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:38,354 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-13 23:20:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:38,364 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 23:20:38,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:38,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:20:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:38,366 INFO L225 Difference]: With dead ends: 31 [2019-10-13 23:20:38,366 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 23:20:38,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 23:20:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 23:20:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 23:20:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 23:20:38,373 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-13 23:20:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:38,375 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 23:20:38,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 23:20:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:20:38,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:38,376 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:38,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:38,377 INFO L82 PathProgramCache]: Analyzing trace with hash -5957836, now seen corresponding path program 1 times [2019-10-13 23:20:38,378 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:38,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244688440] [2019-10-13 23:20:38,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:38,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:38,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:38,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244688440] [2019-10-13 23:20:38,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564627456] [2019-10-13 23:20:38,462 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 23:20:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:38,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:38,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:38,572 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:38,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224585088] [2019-10-13 23:20:38,652 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:38,652 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:38,659 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:38,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:38,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:38,859 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:40,821 INFO L199 IcfgInterpreter]: Interpreting procedure sep with input of size 1 for LOIs [2019-10-13 23:20:40,882 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:40,886 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:40,886 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:40,887 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:20:40,887 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 243#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_sep_~ret~0_BEFORE_RETURN_6 Int) (v_sep_~ret~0_BEFORE_RETURN_5 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_29 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_29 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_5 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_30 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_30 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_sep_~ret~0_BEFORE_RETURN_6 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647) (not (< main_~i~2 4)))))) (and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_sep_~ret~0_BEFORE_RETURN_6 Int) (v_sep_~ret~0_BEFORE_RETURN_5 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_29 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_29 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_5 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_30 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_30 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_sep_~ret~0_BEFORE_RETURN_6 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:40,887 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 601#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_sep_~ret~0_BEFORE_RETURN_2 Int) (v_sep_~ret~0_BEFORE_RETURN_1 Int)) (or (and (<= main_~ret~1 2147483647) (= main_~ret~1 (+ (mod v_sep_~ret~0_BEFORE_RETURN_2 4294967296) (- 4294967296))) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_sep_~ret~0_BEFORE_RETURN_1 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_prenex_1 4294967296)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_1 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_prenex_2 4294967296)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_2 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:40,888 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 666#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:40,888 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 23:20:40,888 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 657#(<= 0 sep_~i~0) [2019-10-13 23:20:40,888 INFO L193 IcfgInterpreter]: Reachable states at location sepENTRY satisfy 610#true [2019-10-13 23:20:40,889 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 23:20:40,889 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 23:20:40,889 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 671#(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 23:20:40,889 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 488#true [2019-10-13 23:20:40,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:40,890 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 531#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:20:40,890 INFO L193 IcfgInterpreter]: Reachable states at location sepEXIT satisfy 662#(and (<= 5 sep_~i~0) (= |sep_#res| (ite (<= (mod sep_~ret~0 4294967296) 2147483647) (mod sep_~ret~0 4294967296) (+ (mod sep_~ret~0 4294967296) (- 4294967296)))) (not (< sep_~i~0 5)) (<= 0 sep_~i~0)) [2019-10-13 23:20:40,890 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 129#(or (exists ((v_prenex_2 Int) (v_sep_~ret~0_BEFORE_RETURN_2 Int)) (or (and (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_2 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647))) (and (= (mod v_prenex_2 4294967296) |main_#t~ret6|) (not (< main_~i~1 5)) (<= (mod v_prenex_2 4294967296) 2147483647)))) (exists ((v_prenex_1 Int) (v_sep_~ret~0_BEFORE_RETURN_1 Int)) (or (and (= (mod v_prenex_1 4294967296) |main_#t~ret6|) (not (< main_~i~1 5)) (<= (mod v_prenex_1 4294967296) 2147483647)) (and (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647)) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_1 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)))))) [2019-10-13 23:20:40,890 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 433#true [2019-10-13 23:20:40,891 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 322#true [2019-10-13 23:20:40,891 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 596#true [2019-10-13 23:20:40,891 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 569#true [2019-10-13 23:20:41,239 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:41,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:20:41,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567851182] [2019-10-13 23:20:41,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:20:41,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:20:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:20:41,244 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 23:20:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:42,166 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-13 23:20:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:20:42,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-13 23:20:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:42,167 INFO L225 Difference]: With dead ends: 40 [2019-10-13 23:20:42,167 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 23:20:42,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:20:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 23:20:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 23:20:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 23:20:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 23:20:42,175 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-13 23:20:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:42,175 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 23:20:42,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:20:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 23:20:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:20:42,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:42,177 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:42,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:42,381 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1961836647, now seen corresponding path program 2 times [2019-10-13 23:20:42,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:42,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427945543] [2019-10-13 23:20:42,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:42,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:42,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:20:42,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427945543] [2019-10-13 23:20:42,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361641615] [2019-10-13 23:20:42,520 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:42,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 23:20:42,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:42,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:42,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:20:42,625 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:20:42,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097258236] [2019-10-13 23:20:42,667 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:42,670 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:42,671 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:42,671 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:42,671 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:42,707 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:44,069 INFO L199 IcfgInterpreter]: Interpreting procedure sep with input of size 1 for LOIs [2019-10-13 23:20:44,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:44,141 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:44,142 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:44,142 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:20:44,142 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 243#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sep_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_224 Int) (v_sep_~ret~0_BEFORE_RETURN_32 Int) (v_prenex_223 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_sep_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= (mod v_sep_~ret~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_prenex_223 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (not (< main_~i~2 4)))))) (and (exists ((v_sep_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_224 Int) (v_sep_~ret~0_BEFORE_RETURN_32 Int) (v_prenex_223 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_sep_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= (mod v_sep_~ret~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_prenex_223 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:44,143 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 601#(exists ((v_prenex_196 Int) (v_sep_~ret~0_BEFORE_RETURN_28 Int) (v_sep_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_195 Int)) (or (and (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) main_~ret~1) (not (<= (mod v_prenex_196 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_195 4294967296) main_~ret~1) (<= (mod v_prenex_195 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_sep_~ret~0_BEFORE_RETURN_28 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sep_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:44,143 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 666#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:44,143 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 23:20:44,143 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 657#(<= 0 sep_~i~0) [2019-10-13 23:20:44,144 INFO L193 IcfgInterpreter]: Reachable states at location sepENTRY satisfy 610#true [2019-10-13 23:20:44,144 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 23:20:44,144 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 23:20:44,144 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 671#(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 23:20:44,144 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 488#true [2019-10-13 23:20:44,144 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:44,145 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 531#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:20:44,145 INFO L193 IcfgInterpreter]: Reachable states at location sepEXIT satisfy 662#(and (<= 5 sep_~i~0) (= |sep_#res| (ite (<= (mod sep_~ret~0 4294967296) 2147483647) (mod sep_~ret~0 4294967296) (+ (mod sep_~ret~0 4294967296) (- 4294967296)))) (not (< sep_~i~0 5)) (<= 0 sep_~i~0)) [2019-10-13 23:20:44,145 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 129#(or (exists ((v_sep_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_195 Int)) (or (and (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) |main_#t~ret6|) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (not (< main_~i~1 5))) (and (= (mod v_prenex_195 4294967296) |main_#t~ret6|) (not (< main_~i~1 5)) (<= (mod v_prenex_195 4294967296) 2147483647)))) (exists ((v_prenex_196 Int) (v_sep_~ret~0_BEFORE_RETURN_28 Int)) (or (and (not (<= (mod v_prenex_196 4294967296) 2147483647)) (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5))) (and (not (< main_~i~1 5)) (= (mod v_sep_~ret~0_BEFORE_RETURN_28 4294967296) |main_#t~ret6|) (<= (mod v_sep_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647))))) [2019-10-13 23:20:44,145 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 433#true [2019-10-13 23:20:44,145 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 322#true [2019-10-13 23:20:44,146 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 596#true [2019-10-13 23:20:44,146 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 569#true [2019-10-13 23:20:44,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:44,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:20:44,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55673857] [2019-10-13 23:20:44,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:20:44,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:20:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:20:44,446 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 18 states. [2019-10-13 23:20:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:45,098 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2019-10-13 23:20:45,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:20:45,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-13 23:20:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:45,100 INFO L225 Difference]: With dead ends: 42 [2019-10-13 23:20:45,100 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 23:20:45,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:20:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 23:20:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-13 23:20:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 23:20:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-13 23:20:45,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2019-10-13 23:20:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:45,113 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-13 23:20:45,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:20:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-13 23:20:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:20:45,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:45,117 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:45,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:45,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:45,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:45,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1430720737, now seen corresponding path program 3 times [2019-10-13 23:20:45,322 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:45,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135462780] [2019-10-13 23:20:45,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:45,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:45,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:20:45,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135462780] [2019-10-13 23:20:45,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654048407] [2019-10-13 23:20:45,478 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:45,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:20:45,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:45,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 23:20:45,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-13 23:20:45,674 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-13 23:20:45,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [989816047] [2019-10-13 23:20:45,721 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:45,722 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:45,722 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:45,722 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:45,723 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:45,739 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:46,969 INFO L199 IcfgInterpreter]: Interpreting procedure sep with input of size 1 for LOIs [2019-10-13 23:20:47,011 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:47,015 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:47,015 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:47,015 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:20:47,016 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 243#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sep_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int) (v_sep_~ret~0_BEFORE_RETURN_58 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (mod v_sep_~ret~0_BEFORE_RETURN_58 4294967296)) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647)) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_prenex_417 4294967296) main_~ret5~0) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)))))) (and (exists ((v_sep_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int) (v_sep_~ret~0_BEFORE_RETURN_58 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (mod v_sep_~ret~0_BEFORE_RETURN_58 4294967296)) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647)) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_prenex_417 4294967296) main_~ret5~0) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:47,016 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 601#(exists ((v_sep_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_389 Int) (v_sep_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_sep_~ret~0_BEFORE_RETURN_54 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sep_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296)) main_~ret~1) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_prenex_389 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_389 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:47,017 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 666#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:47,017 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 23:20:47,018 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 657#(<= 0 sep_~i~0) [2019-10-13 23:20:47,018 INFO L193 IcfgInterpreter]: Reachable states at location sepENTRY satisfy 610#true [2019-10-13 23:20:47,018 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 23:20:47,018 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 23:20:47,019 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 671#(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 23:20:47,019 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 488#true [2019-10-13 23:20:47,019 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:47,019 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 531#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:20:47,020 INFO L193 IcfgInterpreter]: Reachable states at location sepEXIT satisfy 662#(and (<= 5 sep_~i~0) (= |sep_#res| (ite (<= (mod sep_~ret~0 4294967296) 2147483647) (mod sep_~ret~0 4294967296) (+ (mod sep_~ret~0 4294967296) (- 4294967296)))) (not (< sep_~i~0 5)) (<= 0 sep_~i~0)) [2019-10-13 23:20:47,020 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 129#(or (exists ((v_sep_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (= (mod v_sep_~ret~0_BEFORE_RETURN_54 4294967296) |main_#t~ret6|) (not (< main_~i~1 5)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647)) (and (not (< main_~i~1 5)) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (= |main_#t~ret6| (+ (mod v_prenex_390 4294967296) (- 4294967296)))))) (exists ((v_sep_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_389 Int)) (or (and (not (< main_~i~1 5)) (<= (mod v_prenex_389 4294967296) 2147483647) (= (mod v_prenex_389 4294967296) |main_#t~ret6|)) (and (not (< main_~i~1 5)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)) (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296)) |main_#t~ret6|))))) [2019-10-13 23:20:47,020 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 433#true [2019-10-13 23:20:47,020 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 322#true [2019-10-13 23:20:47,021 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 596#true [2019-10-13 23:20:47,021 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 569#true [2019-10-13 23:20:47,395 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:47,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 22 [2019-10-13 23:20:47,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184053041] [2019-10-13 23:20:47,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 23:20:47,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:47,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 23:20:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-10-13 23:20:47,398 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 23 states. [2019-10-13 23:20:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:48,379 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-10-13 23:20:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:20:48,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-10-13 23:20:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:48,381 INFO L225 Difference]: With dead ends: 48 [2019-10-13 23:20:48,381 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 23:20:48,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 23:20:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 23:20:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 23:20:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 23:20:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-13 23:20:48,389 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 41 [2019-10-13 23:20:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:48,389 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-13 23:20:48,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 23:20:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-13 23:20:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:20:48,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:48,391 INFO L380 BasicCegarLoop]: trace histogram [15, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:48,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:48,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash 504323828, now seen corresponding path program 4 times [2019-10-13 23:20:48,595 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:48,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318062787] [2019-10-13 23:20:48,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:48,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:48,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-13 23:20:48,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318062787] [2019-10-13 23:20:48,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50323179] [2019-10-13 23:20:48,694 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:48,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:48,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-13 23:20:48,852 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-13 23:20:48,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1317810249] [2019-10-13 23:20:48,874 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:48,874 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:48,875 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:48,875 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:48,875 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:48,894 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:50,053 INFO L199 IcfgInterpreter]: Interpreting procedure sep with input of size 1 for LOIs [2019-10-13 23:20:50,078 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:50,081 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:50,081 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:50,081 INFO L193 IcfgInterpreter]: Reachable states at location L26-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:20:50,081 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 243#(or (and (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_sep_~ret~0_BEFORE_RETURN_84 Int) (v_sep_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= (mod v_sep_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_sep_~ret~0_BEFORE_RETURN_84 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sep_~ret~0_BEFORE_RETURN_83 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_612 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_612 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_611 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_611 4294967296)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_sep_~ret~0_BEFORE_RETURN_84 Int) (v_sep_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= (mod v_sep_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_sep_~ret~0_BEFORE_RETURN_84 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sep_~ret~0_BEFORE_RETURN_83 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (+ (mod v_prenex_612 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_612 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_611 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_611 4294967296)) (not (< main_~i~2 4))))))) [2019-10-13 23:20:50,082 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 601#(or (exists ((v_prenex_583 Int) (v_prenex_584 Int) (v_sep_~ret~0_BEFORE_RETURN_80 Int) (v_sep_~ret~0_BEFORE_RETURN_79 Int)) (or (and (<= main_~ret~1 2147483647) (= (mod v_prenex_584 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_584 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_583 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sep_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647) (= (mod v_sep_~ret~0_BEFORE_RETURN_79 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_80 4294967296) (- 4294967296)) main_~ret~1) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))))) (exists ((v_prenex_583 Int) (v_prenex_584 Int) (v_sep_~ret~0_BEFORE_RETURN_80 Int) (v_sep_~ret~0_BEFORE_RETURN_79 Int)) (or (and (<= main_~ret~1 2147483647) (= (mod v_prenex_584 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_584 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_583 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_sep_~ret~0_BEFORE_RETURN_79 4294967296) main_~ret~1) (<= (mod v_sep_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_80 4294967296) (- 4294967296)) main_~ret~1) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648)))))) [2019-10-13 23:20:50,082 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 666#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:50,082 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 68#true [2019-10-13 23:20:50,082 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 657#(<= 0 sep_~i~0) [2019-10-13 23:20:50,082 INFO L193 IcfgInterpreter]: Reachable states at location sepENTRY satisfy 610#true [2019-10-13 23:20:50,083 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 23:20:50,083 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 23:20:50,083 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 671#(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 23:20:50,083 INFO L193 IcfgInterpreter]: Reachable states at location L39-1 satisfy 488#true [2019-10-13 23:20:50,083 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:50,083 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 531#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:20:50,084 INFO L193 IcfgInterpreter]: Reachable states at location sepEXIT satisfy 662#(and (<= 5 sep_~i~0) (= |sep_#res| (ite (<= (mod sep_~ret~0 4294967296) 2147483647) (mod sep_~ret~0 4294967296) (+ (mod sep_~ret~0 4294967296) (- 4294967296)))) (not (< sep_~i~0 5)) (<= 0 sep_~i~0)) [2019-10-13 23:20:50,084 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 129#(or (exists ((v_prenex_584 Int) (v_sep_~ret~0_BEFORE_RETURN_80 Int)) (or (and (= (+ (mod v_sep_~ret~0_BEFORE_RETURN_80 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_sep_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647))) (and (not (< main_~i~1 5)) (= (mod v_prenex_584 4294967296) |main_#t~ret6|) (<= (mod v_prenex_584 4294967296) 2147483647)))) (exists ((v_prenex_583 Int) (v_sep_~ret~0_BEFORE_RETURN_79 Int)) (or (and (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 5)) (not (<= (mod v_prenex_583 4294967296) 2147483647))) (and (= (mod v_sep_~ret~0_BEFORE_RETURN_79 4294967296) |main_#t~ret6|) (not (< main_~i~1 5)) (<= (mod v_sep_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647))))) [2019-10-13 23:20:50,084 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 433#true [2019-10-13 23:20:50,084 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 322#true [2019-10-13 23:20:50,084 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 596#true [2019-10-13 23:20:50,085 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 569#true [2019-10-13 23:20:50,504 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:50,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:20:50,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403829375] [2019-10-13 23:20:50,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:20:50,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:20:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:20:50,509 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2019-10-13 23:20:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:51,284 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 23:20:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:20:51,284 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-10-13 23:20:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:51,285 INFO L225 Difference]: With dead ends: 46 [2019-10-13 23:20:51,285 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 23:20:51,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:20:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 23:20:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-13 23:20:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 23:20:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 23:20:51,297 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 45 [2019-10-13 23:20:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:51,298 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 23:20:51,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:20:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 23:20:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:20:51,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:51,304 INFO L380 BasicCegarLoop]: trace histogram [15, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:51,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:51,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash 934351779, now seen corresponding path program 5 times [2019-10-13 23:20:51,515 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:51,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635588710] [2019-10-13 23:20:51,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:51,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:51,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:54,391 ERROR L253 erpolLogProxyWrapper]: Interpolant 16 not inductive [2019-10-13 23:20:55,794 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:863) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:274) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:210) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-13 23:20:55,798 INFO L168 Benchmark]: Toolchain (without parser) took 19289.37 ms. Allocated memory was 139.5 MB in the beginning and 442.0 MB in the end (delta: 302.5 MB). Free memory was 103.9 MB in the beginning and 298.6 MB in the end (delta: -194.6 MB). Peak memory consumption was 311.1 MB. Max. memory is 7.1 GB. [2019-10-13 23:20:55,798 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:20:55,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.76 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 103.7 MB in the beginning and 182.6 MB in the end (delta: -78.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:20:55,799 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 180.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-13 23:20:55,800 INFO L168 Benchmark]: RCFGBuilder took 479.75 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 157.4 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-10-13 23:20:55,800 INFO L168 Benchmark]: TraceAbstraction took 18409.36 ms. Allocated memory was 203.4 MB in the beginning and 442.0 MB in the end (delta: 238.6 MB). Free memory was 157.4 MB in the beginning and 298.6 MB in the end (delta: -141.1 MB). Peak memory consumption was 300.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:20:55,801 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.76 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 103.7 MB in the beginning and 182.6 MB in the end (delta: -78.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 180.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.75 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 157.4 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18409.36 ms. Allocated memory was 203.4 MB in the beginning and 442.0 MB in the end (delta: 238.6 MB). Free memory was 157.4 MB in the beginning and 298.6 MB in the end (delta: -141.1 MB). Peak memory consumption was 300.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...