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-13a467a-m [2019-10-14 21:50:48,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:48,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:48,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:48,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:48,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:48,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:48,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:48,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:48,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:48,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:48,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:48,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:48,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:48,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:48,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:48,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:48,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:48,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:48,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:48,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:48,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:48,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:48,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:48,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:48,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:48,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:48,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:48,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:48,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:48,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:48,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:48,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:48,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:48,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:48,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:48,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:48,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:48,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:48,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:48,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:48,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:50:48,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:48,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:48,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:48,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:48,206 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:48,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:48,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:48,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:48,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:48,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:48,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:48,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:48,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:48,208 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:48,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:48,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:48,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:48,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:48,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:48,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:48,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:48,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:48,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:48,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:48,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:48,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:48,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:48,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:48,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:48,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:48,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:48,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:48,495 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:48,495 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:48,496 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy.c [2019-10-14 21:50:48,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1093ccb7/11c400300dd548d08bccbbc613c7b501/FLAGf826b580d [2019-10-14 21:50:49,049 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:49,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy.c [2019-10-14 21:50:49,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1093ccb7/11c400300dd548d08bccbbc613c7b501/FLAGf826b580d [2019-10-14 21:50:49,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1093ccb7/11c400300dd548d08bccbbc613c7b501 [2019-10-14 21:50:49,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:49,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:49,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:49,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:49,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:49,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b914718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49, skipping insertion in model container [2019-10-14 21:50:49,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:49,455 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:49,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:49,655 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:49,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:49,693 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:49,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49 WrapperNode [2019-10-14 21:50:49,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:49,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:49,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:49,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:49,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... [2019-10-14 21:50:49,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:49,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:49,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:49,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:49,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:49,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 21:50:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:49,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 21:50:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:50,137 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:50,138 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 21:50:50,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:50 BoogieIcfgContainer [2019-10-14 21:50:50,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:50,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:50,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:50,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:50,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:49" (1/3) ... [2019-10-14 21:50:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6bbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:50, skipping insertion in model container [2019-10-14 21:50:50,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:49" (2/3) ... [2019-10-14 21:50:50,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6bbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:50, skipping insertion in model container [2019-10-14 21:50:50,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:50" (3/3) ... [2019-10-14 21:50:50,149 INFO L109 eAbstractionObserver]: Analyzing ICFG tcpy.c [2019-10-14 21:50:50,163 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:50,172 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:50,185 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:50,213 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:50,213 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:50,213 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:50,214 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:50,214 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:50,214 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:50,214 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:50,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-14 21:50:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:50,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:50,242 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:50,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash 941892528, now seen corresponding path program 1 times [2019-10-14 21:50:50,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:50,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808602951] [2019-10-14 21:50:50,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:50,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808602951] [2019-10-14 21:50:50,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:50,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:50:50,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134165285] [2019-10-14 21:50:50,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:50:50,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:50:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:50,485 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-14 21:50:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:50,614 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2019-10-14 21:50:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:50:50,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 21:50:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:50,624 INFO L225 Difference]: With dead ends: 47 [2019-10-14 21:50:50,624 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 21:50:50,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 21:50:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 21:50:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 21:50:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-14 21:50:50,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-10-14 21:50:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:50,664 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-14 21:50:50,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:50:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-14 21:50:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:50,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:50,666 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:50,666 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2128337372, now seen corresponding path program 1 times [2019-10-14 21:50:50,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:50,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450562474] [2019-10-14 21:50:50,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:50,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450562474] [2019-10-14 21:50:50,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:50,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:50,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377780057] [2019-10-14 21:50:50,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:50,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:50,801 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2019-10-14 21:50:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:50,921 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-14 21:50:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:50,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-14 21:50:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:50,924 INFO L225 Difference]: With dead ends: 39 [2019-10-14 21:50:50,924 INFO L226 Difference]: Without dead ends: 25 [2019-10-14 21:50:50,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-14 21:50:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-14 21:50:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 21:50:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-14 21:50:50,941 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-10-14 21:50:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:50,942 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-14 21:50:50,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-14 21:50:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 21:50:50,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:50,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:50,946 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash 823833890, now seen corresponding path program 1 times [2019-10-14 21:50:50,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:50,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549382496] [2019-10-14 21:50:50,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:51,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549382496] [2019-10-14 21:50:51,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:51,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:51,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120206135] [2019-10-14 21:50:51,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:51,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:51,073 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-10-14 21:50:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:51,216 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-14 21:50:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:51,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 21:50:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:51,220 INFO L225 Difference]: With dead ends: 42 [2019-10-14 21:50:51,220 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:50:51,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:50:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-14 21:50:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-14 21:50:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-14 21:50:51,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-10-14 21:50:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:51,233 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-14 21:50:51,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-14 21:50:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 21:50:51,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:51,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:51,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:51,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1371679936, now seen corresponding path program 1 times [2019-10-14 21:50:51,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:51,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479183027] [2019-10-14 21:50:51,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:51,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479183027] [2019-10-14 21:50:51,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717723142] [2019-10-14 21:50:51,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:50:51,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 21:50:51,501 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:51,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-14 21:50:51,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209358007] [2019-10-14 21:50:51,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 21:50:51,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 21:50:51,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:50:51,505 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2019-10-14 21:50:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:51,645 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-14 21:50:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:51,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 21:50:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:51,647 INFO L225 Difference]: With dead ends: 43 [2019-10-14 21:50:51,647 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 21:50:51,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:50:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 21:50:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-14 21:50:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 21:50:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-14 21:50:51,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-10-14 21:50:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:51,665 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-14 21:50:51,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 21:50:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-14 21:50:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:51,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:51,668 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:51,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:51,875 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -172159810, now seen corresponding path program 2 times [2019-10-14 21:50:51,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:51,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674931494] [2019-10-14 21:50:51,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:52,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674931494] [2019-10-14 21:50:52,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803980004] [2019-10-14 21:50:52,393 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:52,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:52,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:52,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 21:50:52,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:52,498 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-10-14 21:50:52,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-14 21:50:52,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,627 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-10-14 21:50:52,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,650 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-10-14 21:50:52,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2019-10-14 21:50:52,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,808 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-10-14 21:50:52,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-10-14 21:50:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:52,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:52,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-10-14 21:50:52,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578699862] [2019-10-14 21:50:52,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:50:52,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:50:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:50:52,890 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 19 states. [2019-10-14 21:50:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:53,981 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-10-14 21:50:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 21:50:53,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-10-14 21:50:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:53,985 INFO L225 Difference]: With dead ends: 76 [2019-10-14 21:50:53,985 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 21:50:53,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2019-10-14 21:50:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 21:50:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 33. [2019-10-14 21:50:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:50:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-14 21:50:53,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-14 21:50:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:53,997 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-14 21:50:53,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:50:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-14 21:50:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:53,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:53,999 INFO L380 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-10-14 21:50:54,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:54,208 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash 606859858, now seen corresponding path program 1 times [2019-10-14 21:50:54,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:54,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637050733] [2019-10-14 21:50:54,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:54,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:54,916 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2019-10-14 21:50:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:55,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637050733] [2019-10-14 21:50:55,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603432917] [2019-10-14 21:50:55,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:55,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-14 21:50:55,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:55,370 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-10-14 21:50:55,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:55,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-14 21:50:55,433 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-10-14 21:50:55,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:55,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-10-14 21:50:55,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:55,588 INFO L341 Elim1Store]: treesize reduction 31, result has 45.6 percent of original size [2019-10-14 21:50:55,589 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-10-14 21:50:55,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:55,610 INFO L567 ElimStorePlain]: treesize reduction 26, result has 62.3 percent of original size [2019-10-14 21:50:55,611 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-10-14 21:50:55,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2019-10-14 21:50:57,729 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 ((.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_1)) (.cse1 (select |c_#memory_int| v_main_~a~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) (<= ~SIZE~0 2) (let ((.cse2 (* ~SIZE~0 4))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_1 .cse2 (- 4))) (select .cse1 (+ .cse2 v_main_~a~0.offset_BEFORE_CALL_1 (- 4)))))))) is different from true [2019-10-14 21:50:57,905 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-10-14 21:50:57,905 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-10-14 21:50:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:57,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:57,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:57,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:57,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-10-14 21:50:57,943 INFO L567 ElimStorePlain]: treesize reduction 95, result has 12.8 percent of original size [2019-10-14 21:50:57,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:57,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:3 [2019-10-14 21:50:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-14 21:50:57,994 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:57,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-10-14 21:50:57,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967790347] [2019-10-14 21:50:57,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 21:50:57,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 21:50:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=531, Unknown=1, NotChecked=46, Total=650 [2019-10-14 21:50:57,996 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 26 states. [2019-10-14 21:51:00,712 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2019-10-14 21:51:02,800 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-14 21:51:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:09,336 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-10-14 21:51:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 21:51:09,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-10-14 21:51:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:09,341 INFO L225 Difference]: With dead ends: 81 [2019-10-14 21:51:09,341 INFO L226 Difference]: Without dead ends: 62 [2019-10-14 21:51:09,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=4, NotChecked=78, Total=1722 [2019-10-14 21:51:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-14 21:51:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-10-14 21:51:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 21:51:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-10-14 21:51:09,354 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 30 [2019-10-14 21:51:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:09,354 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-10-14 21:51:09,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-14 21:51:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-10-14 21:51:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 21:51:09,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:09,356 INFO L380 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-10-14 21:51:09,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:09,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1975161648, now seen corresponding path program 2 times [2019-10-14 21:51:09,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:09,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854938938] [2019-10-14 21:51:09,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:09,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:51:09,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854938938] [2019-10-14 21:51:09,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081771766] [2019-10-14 21:51:09,832 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:09,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:51:09,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:09,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 21:51:09,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:51:10,061 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:10,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-14 21:51:10,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388170309] [2019-10-14 21:51:10,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 21:51:10,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:10,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 21:51:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:51:10,064 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 14 states. [2019-10-14 21:51:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:10,491 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-10-14 21:51:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:51:10,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-14 21:51:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:10,493 INFO L225 Difference]: With dead ends: 83 [2019-10-14 21:51:10,493 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 21:51:10,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-10-14 21:51:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 21:51:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-10-14 21:51:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 21:51:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-14 21:51:10,505 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 32 [2019-10-14 21:51:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:10,506 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-14 21:51:10,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 21:51:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-14 21:51:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:51:10,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:10,507 INFO L380 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-10-14 21:51:10,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:10,719 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash -42121234, now seen corresponding path program 3 times [2019-10-14 21:51:10,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:10,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848669916] [2019-10-14 21:51:10,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:10,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:10,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 21:51:10,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848669916] [2019-10-14 21:51:10,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115706541] [2019-10-14 21:51:10,905 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:10,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:51:10,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:10,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 21:51:10,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:10,980 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-10-14 21:51:10,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:10,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:10,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:10,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-14 21:51:11,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:11,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:11,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:11,078 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-10-14 21:51:11,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:11,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:11,093 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-10-14 21:51:11,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-10-14 21:51:13,201 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 ((.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_2)) (.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_2))) (and (= (mod ~SIZE~0 2) 0) (= (select .cse0 4) (select .cse1 4)) (not (= v_main_~a~0.base_BEFORE_CALL_2 v_main_~acopy~0.base_BEFORE_CALL_2)) (let ((.cse2 (+ (* ~SIZE~0 4) (- 8)))) (= (select .cse0 .cse2) (select .cse1 .cse2)))))) is different from true [2019-10-14 21:51:13,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:51:13,307 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-10-14 21:51:13,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:51:13,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:51:13,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-10-14 21:51:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2019-10-14 21:51:13,388 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:13,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-10-14 21:51:13,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337032189] [2019-10-14 21:51:13,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 21:51:13,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 21:51:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=330, Unknown=1, NotChecked=36, Total=420 [2019-10-14 21:51:13,390 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 21 states. [2019-10-14 21:51:16,016 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-14 21:51:20,531 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-14 21:51:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:37,451 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2019-10-14 21:51:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-14 21:51:37,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-10-14 21:51:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:37,454 INFO L225 Difference]: With dead ends: 125 [2019-10-14 21:51:37,454 INFO L226 Difference]: Without dead ends: 102 [2019-10-14 21:51:37,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=384, Invalid=2060, Unknown=10, NotChecked=96, Total=2550 [2019-10-14 21:51:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-14 21:51:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 51. [2019-10-14 21:51:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-14 21:51:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-10-14 21:51:37,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 34 [2019-10-14 21:51:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:37,470 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-10-14 21:51:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 21:51:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-10-14 21:51:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 21:51:37,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:37,472 INFO L380 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-10-14 21:51:37,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:37,673 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash -210369562, now seen corresponding path program 4 times [2019-10-14 21:51:37,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:37,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32682644] [2019-10-14 21:51:37,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:37,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:37,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:51:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:51:37,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32682644] [2019-10-14 21:51:37,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248159109] [2019-10-14 21:51:37,773 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:37,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:51:37,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:51:37,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 21:51:37,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:51:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:51:37,884 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:37,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-10-14 21:51:37,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74760207] [2019-10-14 21:51:37,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 21:51:37,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 21:51:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-14 21:51:37,886 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 14 states. [2019-10-14 21:51:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:51:38,134 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-10-14 21:51:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 21:51:38,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-10-14 21:51:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:51:38,135 INFO L225 Difference]: With dead ends: 89 [2019-10-14 21:51:38,136 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 21:51:38,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:51:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 21:51:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-10-14 21:51:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 21:51:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-10-14 21:51:38,146 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2019-10-14 21:51:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:51:38,146 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-10-14 21:51:38,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 21:51:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-10-14 21:51:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 21:51:38,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:51:38,148 INFO L380 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-10-14 21:51:38,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:51:38,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:51:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:51:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -595219712, now seen corresponding path program 5 times [2019-10-14 21:51:38,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:51:38,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959569023] [2019-10-14 21:51:38,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:38,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:51:38,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:51:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat