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 -i ../../../trunk/examples/svcomp/array-tiling/tcpy.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:20,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:20,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:20,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:20,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:20,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:20,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:20,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:20,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:20,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:20,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:20,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:20,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:20,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:20,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:20,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:20,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:20,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:20,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:20,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:20,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:20,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:20,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:20,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:20,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:20,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:20,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:20,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:20,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:20,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:20,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:20,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:20,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:20,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:20,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:20,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:20,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:20,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:20,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:20,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:20,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:20,326 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-09-20 12:59:20,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:20,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:20,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:20,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:20,342 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:20,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:20,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:20,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:20,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:20,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:20,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:20,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:20,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:20,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:20,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:20,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:20,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:20,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:20,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:20,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:20,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:20,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:20,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:20,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:20,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:20,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:20,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:20,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:20,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:20,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:20,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:20,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:20,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:20,392 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:20,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy.c [2019-09-20 12:59:20,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e1b92c3/a0ef8e52e524476a8b9ab0ff77fbd533/FLAG9d8fd0f14 [2019-09-20 12:59:20,910 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:20,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy.c [2019-09-20 12:59:20,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e1b92c3/a0ef8e52e524476a8b9ab0ff77fbd533/FLAG9d8fd0f14 [2019-09-20 12:59:21,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e1b92c3/a0ef8e52e524476a8b9ab0ff77fbd533 [2019-09-20 12:59:21,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:21,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:21,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:21,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:21,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:21,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ac53bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21, skipping insertion in model container [2019-09-20 12:59:21,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,320 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:21,341 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:21,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:21,592 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:21,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:21,626 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:21,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21 WrapperNode [2019-09-20 12:59:21,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:21,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:21,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:21,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:21,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (1/1) ... [2019-09-20 12:59:21,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:21,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:21,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:21,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:21,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (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-09-20 12:59:21,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:21,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:21,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:59:21,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:59:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:59:21,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 12:59:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 12:59:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 12:59:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 12:59:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:21,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:59:22,119 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:22,119 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 12:59:22,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:22 BoogieIcfgContainer [2019-09-20 12:59:22,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:22,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:22,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:22,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:22,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:21" (1/3) ... [2019-09-20 12:59:22,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72027b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:22, skipping insertion in model container [2019-09-20 12:59:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:21" (2/3) ... [2019-09-20 12:59:22,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72027b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:22, skipping insertion in model container [2019-09-20 12:59:22,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:22" (3/3) ... [2019-09-20 12:59:22,128 INFO L109 eAbstractionObserver]: Analyzing ICFG tcpy.c [2019-09-20 12:59:22,138 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:22,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:22,187 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:22,210 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:22,210 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:22,210 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:22,210 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:22,211 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:22,211 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:22,211 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:22,211 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:22,211 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-20 12:59:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:59:22,232 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:22,233 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:22,234 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 941892528, now seen corresponding path program 1 times [2019-09-20 12:59:22,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:59:22,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:59:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:59:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:22,407 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-20 12:59:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:22,426 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2019-09-20 12:59:22,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:59:22,427 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-20 12:59:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:22,434 INFO L225 Difference]: With dead ends: 47 [2019-09-20 12:59:22,434 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 12:59:22,438 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 12:59:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-20 12:59:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 12:59:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-20 12:59:22,472 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-09-20 12:59:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:22,473 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-20 12:59:22,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:59:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-20 12:59:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:59:22,474 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:22,474 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:22,474 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2128337372, now seen corresponding path program 1 times [2019-09-20 12:59:22,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:22,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:22,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:22,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:22,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:22,587 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-09-20 12:59:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:22,643 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-20 12:59:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:22,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 12:59:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:22,645 INFO L225 Difference]: With dead ends: 39 [2019-09-20 12:59:22,645 INFO L226 Difference]: Without dead ends: 25 [2019-09-20 12:59:22,646 INFO L636 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-09-20 12:59:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-20 12:59:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-20 12:59:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-20 12:59:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-20 12:59:22,653 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-20 12:59:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:22,654 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-20 12:59:22,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-20 12:59:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 12:59:22,655 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:22,655 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:22,655 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 823833890, now seen corresponding path program 1 times [2019-09-20 12:59:22,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:22,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:22,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:22,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:22,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:22,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:22,783 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-09-20 12:59:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:22,857 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-20 12:59:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:22,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-20 12:59:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:22,861 INFO L225 Difference]: With dead ends: 42 [2019-09-20 12:59:22,861 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 12:59:22,862 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 12:59:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-20 12:59:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 12:59:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-20 12:59:22,873 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-09-20 12:59:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:22,874 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-20 12:59:22,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-20 12:59:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:22,875 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:22,876 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:22,876 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1371679936, now seen corresponding path program 1 times [2019-09-20 12:59:22,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:22,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:22,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:22,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:22,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:22,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:23,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:23,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:23,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:23,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-20 12:59:23,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:23,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:23,092 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-09-20 12:59:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:23,220 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-20 12:59:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:23,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-20 12:59:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:23,221 INFO L225 Difference]: With dead ends: 43 [2019-09-20 12:59:23,222 INFO L226 Difference]: Without dead ends: 28 [2019-09-20 12:59:23,222 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-20 12:59:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-20 12:59:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 12:59:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-20 12:59:23,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-09-20 12:59:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:23,230 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-20 12:59:23,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-20 12:59:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 12:59:23,231 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:23,231 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:23,232 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash -172159810, now seen corresponding path program 2 times [2019-09-20 12:59:23,232 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:23,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:24,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:24,068 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:24,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:24,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:24,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:24,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-20 12:59:24,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:24,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:59:24,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:24,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:59:24,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:24,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:24,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:24,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2019-09-20 12:59:24,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:24,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 12:59:24,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2019-09-20 12:59:24,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:24,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-20 12:59:24,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:24,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:24,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-20 12:59:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:24,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:24,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2019-09-20 12:59:24,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-20 12:59:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-20 12:59:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-20 12:59:24,501 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 20 states. [2019-09-20 12:59:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:25,813 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-09-20 12:59:25,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-20 12:59:25,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-09-20 12:59:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:25,817 INFO L225 Difference]: With dead ends: 76 [2019-09-20 12:59:25,818 INFO L226 Difference]: Without dead ends: 74 [2019-09-20 12:59:25,820 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2019-09-20 12:59:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-20 12:59:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 33. [2019-09-20 12:59:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 12:59:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-20 12:59:25,839 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-09-20 12:59:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:25,839 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-20 12:59:25,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-20 12:59:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-20 12:59:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:59:25,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:25,842 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:25,843 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:25,844 INFO L82 PathProgramCache]: Analyzing trace with hash 606859858, now seen corresponding path program 1 times [2019-09-20 12:59:25,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:25,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:26,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:26,816 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:26,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-20 12:59:26,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:26,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:59:26,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:26,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:26,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:26,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:59:26,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-20 12:59:26,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:26,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:26,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:26,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-20 12:59:27,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:27,080 INFO L341 Elim1Store]: treesize reduction 31, result has 45.6 percent of original size [2019-09-20 12:59:27,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 52 [2019-09-20 12:59:27,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:27,103 INFO L567 ElimStorePlain]: treesize reduction 26, result has 62.3 percent of original size [2019-09-20 12:59:27,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 12:59:27,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2019-09-20 12:59:29,222 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~acopy~0.offset_BEFORE_CALL_1 Int) (v_main_~acopy~0.base_BEFORE_CALL_1 Int) (~SIZE~0 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_1))) (and (= (select .cse0 v_main_~acopy~0.offset_BEFORE_CALL_1) (select .cse1 v_main_~a~0.offset_BEFORE_CALL_1)) (not (= v_main_~a~0.base_BEFORE_CALL_1 v_main_~acopy~0.base_BEFORE_CALL_1)) (< 1 ~SIZE~0) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ .cse2 v_main_~a~0.offset_BEFORE_CALL_1 (- 4))) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_1 .cse2 (- 4))))) (<= ~SIZE~0 2)))) is different from true [2019-09-20 12:59:29,400 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-09-20 12:59:29,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 69 [2019-09-20 12:59:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:29,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:29,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:29,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:29,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:29,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-20 12:59:29,427 INFO L567 ElimStorePlain]: treesize reduction 23, result has 37.8 percent of original size [2019-09-20 12:59:29,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:29,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:3 [2019-09-20 12:59:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-20 12:59:29,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-09-20 12:59:29,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-20 12:59:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-20 12:59:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2019-09-20 12:59:29,499 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 25 states. [2019-09-20 12:59:34,158 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-20 12:59:36,215 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-20 12:59:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:40,639 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-09-20 12:59:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 12:59:40,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-09-20 12:59:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:40,644 INFO L225 Difference]: With dead ends: 81 [2019-09-20 12:59:40,644 INFO L226 Difference]: Without dead ends: 62 [2019-09-20 12:59:40,645 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=4, NotChecked=72, Total=1482 [2019-09-20 12:59:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-20 12:59:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-09-20 12:59:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-20 12:59:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-09-20 12:59:40,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 30 [2019-09-20 12:59:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:40,658 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-09-20 12:59:40,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-20 12:59:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-09-20 12:59:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:40,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:40,660 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:40,660 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1975161648, now seen corresponding path program 2 times [2019-09-20 12:59:40,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:40,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 12:59:40,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:40,896 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:40,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:40,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:40,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:59:40,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:41,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:41,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-20 12:59:41,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:59:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:59:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:41,055 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 13 states. [2019-09-20 12:59:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:41,360 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-09-20 12:59:41,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 12:59:41,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-20 12:59:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:41,362 INFO L225 Difference]: With dead ends: 83 [2019-09-20 12:59:41,362 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 12:59:41,364 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:59:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 12:59:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-09-20 12:59:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 12:59:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-09-20 12:59:41,374 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 32 [2019-09-20 12:59:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:41,375 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-09-20 12:59:41,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:59:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-09-20 12:59:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 12:59:41,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:41,376 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:41,377 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash -42121234, now seen corresponding path program 3 times [2019-09-20 12:59:41,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:41,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:41,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:41,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 12:59:41,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:41,549 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:41,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:59:41,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:41,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-20 12:59:41,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:41,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:59:41,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:41,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:41,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:41,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:59:41,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:41,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:41,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:41,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-09-20 12:59:41,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:41,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:41,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 12:59:41,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-09-20 12:59:43,841 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (~SIZE~0 Int) (v_main_~acopy~0.base_BEFORE_CALL_2 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_2)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_2))) (and (let ((.cse1 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (mod ~SIZE~0 2) 0) (= (select .cse2 4) (select .cse0 4)) (not (= v_main_~a~0.base_BEFORE_CALL_2 v_main_~acopy~0.base_BEFORE_CALL_2))))) is different from true [2019-09-20 12:59:43,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:43,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-20 12:59:43,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:43,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:43,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:43,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-20 12:59:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2019-09-20 12:59:44,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:44,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-20 12:59:44,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-20 12:59:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-20 12:59:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2019-09-20 12:59:44,007 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 20 states. [2019-09-20 12:59:54,606 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-20 12:59:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,733 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-09-20 12:59:59,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-20 12:59:59,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-09-20 12:59:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,735 INFO L225 Difference]: With dead ends: 122 [2019-09-20 12:59:59,735 INFO L226 Difference]: Without dead ends: 99 [2019-09-20 12:59:59,736 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=365, Invalid=1702, Unknown=7, NotChecked=88, Total=2162 [2019-09-20 12:59:59,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-20 12:59:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2019-09-20 12:59:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-20 12:59:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-09-20 12:59:59,765 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 34 [2019-09-20 12:59:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,765 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-09-20 12:59:59,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-20 12:59:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-09-20 12:59:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 12:59:59,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,767 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:59,768 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash -210369562, now seen corresponding path program 4 times [2019-09-20 12:59:59,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 12:59:59,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:59,883 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:59,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:59,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:59,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:59,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:59:59,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:00:00,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:00,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-20 13:00:00,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:00:00,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:00:00,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:00,008 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 13 states. [2019-09-20 13:00:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:00,210 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-09-20 13:00:00,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:00,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-20 13:00:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:00,212 INFO L225 Difference]: With dead ends: 89 [2019-09-20 13:00:00,212 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 13:00:00,213 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:00:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 13:00:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-09-20 13:00:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-20 13:00:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-20 13:00:00,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2019-09-20 13:00:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:00,226 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-20 13:00:00,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:00:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-20 13:00:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:00:00,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:00,228 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:00,228 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash -595219712, now seen corresponding path program 5 times [2019-09-20 13:00:00,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:00,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:00,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:00:00,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:00,980 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 39 [2019-09-20 13:00:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:00:01,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:01,621 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:01,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 13:00:01,730 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-20 13:00:01,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:00:01,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-20 13:00:01,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:02,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,141 INFO L341 Elim1Store]: treesize reduction 39, result has 36.1 percent of original size [2019-09-20 13:00:02,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 43 [2019-09-20 13:00:02,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:02,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:02,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:02,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:49 [2019-09-20 13:00:02,490 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,516 INFO L341 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2019-09-20 13:00:02,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 35 [2019-09-20 13:00:02,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:02,530 INFO L567 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-09-20 13:00:02,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:02,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2019-09-20 13:00:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:00:02,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:02,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2019-09-20 13:00:02,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-20 13:00:02,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-20 13:00:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2019-09-20 13:00:02,633 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 35 states. [2019-09-20 13:00:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:04,851 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-09-20 13:00:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:00:04,852 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2019-09-20 13:00:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:04,853 INFO L225 Difference]: With dead ends: 112 [2019-09-20 13:00:04,853 INFO L226 Difference]: Without dead ends: 85 [2019-09-20 13:00:04,855 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=350, Invalid=2200, Unknown=0, NotChecked=0, Total=2550 [2019-09-20 13:00:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-20 13:00:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-09-20 13:00:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-20 13:00:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-20 13:00:04,887 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 44 [2019-09-20 13:00:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:04,888 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-20 13:00:04,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-20 13:00:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-20 13:00:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:00:04,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:04,891 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:04,893 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash -310382338, now seen corresponding path program 6 times [2019-09-20 13:00:04,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:04,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:04,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:00:04,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:00:05,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:05,292 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:05,331 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 13:00:05,383 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-20 13:00:05,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:00:05,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-20 13:00:05,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:05,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 13:00:05,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:05,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-20 13:00:05,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-20 13:00:05,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:05,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-09-20 13:00:05,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-20 13:00:05,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,562 INFO L567 ElimStorePlain]: treesize reduction 3, result has 89.3 percent of original size [2019-09-20 13:00:05,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2019-09-20 13:00:05,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-20 13:00:05,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:05,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-20 13:00:05,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:05,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 101 [2019-09-20 13:00:05,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,704 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-09-20 13:00:05,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:05,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:65 [2019-09-20 13:00:05,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:05,955 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-20 13:00:05,955 INFO L341 Elim1Store]: treesize reduction 90, result has 74.9 percent of original size [2019-09-20 13:00:05,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 337 [2019-09-20 13:00:05,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:06,059 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-20 13:00:06,060 INFO L567 ElimStorePlain]: treesize reduction 310, result has 27.2 percent of original size [2019-09-20 13:00:06,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:06,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:144, output treesize:116 [2019-09-20 13:00:06,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:06,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms