/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/verifythis/tree_max.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:21:56,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:21:56,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:21:56,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:21:56,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:21:56,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:21:56,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:21:56,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:21:56,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:21:56,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:21:56,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:21:56,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:21:56,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:21:56,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:21:56,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:21:56,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:21:56,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:21:56,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:21:56,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:21:56,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:21:56,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:21:56,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:21:56,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:21:56,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:21:56,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:21:56,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:21:56,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:21:56,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:21:56,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:21:56,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:21:56,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:21:56,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:21:56,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:21:56,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:21:56,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:21:56,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:21:56,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:21:56,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:21:56,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:21:56,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:21:56,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:21:56,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:21:56,757 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:21:56,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:21:56,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:21:56,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:21:56,763 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:21:56,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:21:56,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:21:56,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:21:56,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:21:56,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:21:56,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:21:56,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:21:56,766 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:21:56,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:21:56,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:21:56,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:21:56,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:21:56,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:21:56,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:21:56,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:21:56,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:21:56,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:21:56,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:21:56,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:21:56,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:21:56,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:21:57,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:21:57,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:21:57,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:21:57,204 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:21:57,205 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:21:57,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2021-01-06 19:21:57,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/60329eb83/7cdb788aea9e4dd6819370ccc1dff388/FLAGf9e2852fa [2021-01-06 19:21:58,006 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:21:58,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2021-01-06 19:21:58,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/60329eb83/7cdb788aea9e4dd6819370ccc1dff388/FLAGf9e2852fa [2021-01-06 19:21:58,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/60329eb83/7cdb788aea9e4dd6819370ccc1dff388 [2021-01-06 19:21:58,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:21:58,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:21:58,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:58,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:21:58,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:21:58,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51791ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58, skipping insertion in model container [2021-01-06 19:21:58,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:21:58,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:21:58,537 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c[544,557] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] [2021-01-06 19:21:58,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:58,571 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:21:58,585 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c[544,557] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] [2021-01-06 19:21:58,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:58,615 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:21:58,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58 WrapperNode [2021-01-06 19:21:58,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:58,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:58,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:21:58,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:21:58,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:58,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:21:58,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:21:58,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:21:58,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... [2021-01-06 19:21:58,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:21:58,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:21:58,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:21:58,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:21:58,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:21:58,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 19:21:58,798 INFO L130 BoogieDeclarations]: Found specification of procedure max [2021-01-06 19:21:58,798 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2021-01-06 19:21:58,798 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-01-06 19:21:58,798 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-01-06 19:21:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:21:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-01-06 19:21:58,799 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-01-06 19:21:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 19:21:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:21:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 19:21:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 19:21:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:21:58,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:21:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 19:21:59,264 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:21:59,265 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-01-06 19:21:59,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:59 BoogieIcfgContainer [2021-01-06 19:21:59,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:21:59,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:21:59,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:21:59,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:21:59,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:21:58" (1/3) ... [2021-01-06 19:21:59,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc7ac77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:59, skipping insertion in model container [2021-01-06 19:21:59,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:58" (2/3) ... [2021-01-06 19:21:59,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc7ac77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:59, skipping insertion in model container [2021-01-06 19:21:59,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:59" (3/3) ... [2021-01-06 19:21:59,275 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_max.c [2021-01-06 19:21:59,282 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:21:59,292 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:21:59,314 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:21:59,343 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:21:59,344 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:21:59,344 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:21:59,344 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:21:59,344 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:21:59,344 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:21:59,345 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:21:59,345 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:21:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2021-01-06 19:21:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 19:21:59,371 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:59,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:21:59,372 INFO L429 AbstractCegarLoop]: === Iteration 1 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 998783614, now seen corresponding path program 1 times [2021-01-06 19:21:59,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:59,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445014422] [2021-01-06 19:21:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-01-06 19:21:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:59,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445014422] [2021-01-06 19:21:59,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:59,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:21:59,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970564037] [2021-01-06 19:21:59,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:21:59,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:21:59,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:21:59,937 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 8 states. [2021-01-06 19:22:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:00,674 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2021-01-06 19:22:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:22:00,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 19:22:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:00,690 INFO L225 Difference]: With dead ends: 74 [2021-01-06 19:22:00,691 INFO L226 Difference]: Without dead ends: 35 [2021-01-06 19:22:00,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:22:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-01-06 19:22:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-01-06 19:22:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-01-06 19:22:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2021-01-06 19:22:00,754 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 18 [2021-01-06 19:22:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:00,754 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-01-06 19:22:00,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:22:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2021-01-06 19:22:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 19:22:00,757 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:00,757 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:00,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:22:00,758 INFO L429 AbstractCegarLoop]: === Iteration 2 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash -976273983, now seen corresponding path program 1 times [2021-01-06 19:22:00,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:00,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311694180] [2021-01-06 19:22:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:00,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:22:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:22:01,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311694180] [2021-01-06 19:22:01,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:22:01,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:22:01,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884504879] [2021-01-06 19:22:01,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:22:01,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:01,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:22:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:22:01,196 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 9 states. [2021-01-06 19:22:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:01,682 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2021-01-06 19:22:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:22:01,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-06 19:22:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:01,688 INFO L225 Difference]: With dead ends: 48 [2021-01-06 19:22:01,688 INFO L226 Difference]: Without dead ends: 37 [2021-01-06 19:22:01,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:22:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-01-06 19:22:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-01-06 19:22:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-01-06 19:22:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-01-06 19:22:01,703 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 28 [2021-01-06 19:22:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:01,704 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-01-06 19:22:01,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:22:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2021-01-06 19:22:01,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:22:01,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:01,706 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:01,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:22:01,707 INFO L429 AbstractCegarLoop]: === Iteration 3 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1376325807, now seen corresponding path program 1 times [2021-01-06 19:22:01,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:01,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146127048] [2021-01-06 19:22:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:01,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:22:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:02,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:02,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:22:02,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146127048] [2021-01-06 19:22:02,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325322274] [2021-01-06 19:22:02,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:22:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:02,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjunts are in the unsatisfiable core [2021-01-06 19:22:02,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:02,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:02,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:22:02,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:02,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2021-01-06 19:22:02,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913655679] [2021-01-06 19:22:02,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 19:22:02,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 19:22:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:22:02,546 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 14 states. [2021-01-06 19:22:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:02,972 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2021-01-06 19:22:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 19:22:02,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2021-01-06 19:22:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:02,974 INFO L225 Difference]: With dead ends: 46 [2021-01-06 19:22:02,975 INFO L226 Difference]: Without dead ends: 44 [2021-01-06 19:22:02,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-01-06 19:22:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-01-06 19:22:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2021-01-06 19:22:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-01-06 19:22:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2021-01-06 19:22:02,985 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 41 [2021-01-06 19:22:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:02,986 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-01-06 19:22:02,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 19:22:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2021-01-06 19:22:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 19:22:02,988 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:02,990 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:03,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 19:22:03,206 INFO L429 AbstractCegarLoop]: === Iteration 4 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2126921006, now seen corresponding path program 1 times [2021-01-06 19:22:03,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:03,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34629338] [2021-01-06 19:22:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:22:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:22:03,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34629338] [2021-01-06 19:22:03,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331880715] [2021-01-06 19:22:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:22:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:03,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-06 19:22:03,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:03,984 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:03,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:03,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,000 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:04,001 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,005 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,005 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2021-01-06 19:22:04,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 19:22:04,102 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 19:22:04,106 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 19:22:04,119 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-06 19:22:04,121 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,130 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,130 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2021-01-06 19:22:04,526 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-01-06 19:22:04,527 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,537 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-01-06 19:22:04,539 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:04,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:04,544 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2021-01-06 19:22:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:22:04,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:04,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 33 [2021-01-06 19:22:04,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023923105] [2021-01-06 19:22:04,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-06 19:22:04,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-06 19:22:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 19:22:04,585 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 33 states. [2021-01-06 19:22:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:07,216 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2021-01-06 19:22:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-06 19:22:07,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2021-01-06 19:22:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:07,222 INFO L225 Difference]: With dead ends: 121 [2021-01-06 19:22:07,222 INFO L226 Difference]: Without dead ends: 107 [2021-01-06 19:22:07,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=382, Invalid=3650, Unknown=0, NotChecked=0, Total=4032 [2021-01-06 19:22:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-06 19:22:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2021-01-06 19:22:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-06 19:22:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2021-01-06 19:22:07,249 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 47 [2021-01-06 19:22:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:07,250 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2021-01-06 19:22:07,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-06 19:22:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2021-01-06 19:22:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 19:22:07,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:07,254 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:07,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:07,469 INFO L429 AbstractCegarLoop]: === Iteration 5 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2051682644, now seen corresponding path program 1 times [2021-01-06 19:22:07,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:07,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810491405] [2021-01-06 19:22:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:22:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:22:07,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810491405] [2021-01-06 19:22:07,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898568452] [2021-01-06 19:22:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:22:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:07,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 49 conjunts are in the unsatisfiable core [2021-01-06 19:22:07,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:07,924 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:07,925 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:07,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:07,939 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:07,940 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:07,949 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:07,950 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:07,951 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:37 [2021-01-06 19:22:08,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 19:22:08,296 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:08,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:08,307 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-01-06 19:22:08,309 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:08,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:08,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:08,316 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:13 [2021-01-06 19:22:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 19:22:08,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:08,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2021-01-06 19:22:08,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664840544] [2021-01-06 19:22:08,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 19:22:08,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 19:22:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-01-06 19:22:08,345 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand 21 states. [2021-01-06 19:22:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:09,251 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2021-01-06 19:22:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:22:09,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2021-01-06 19:22:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:09,254 INFO L225 Difference]: With dead ends: 141 [2021-01-06 19:22:09,254 INFO L226 Difference]: Without dead ends: 98 [2021-01-06 19:22:09,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2021-01-06 19:22:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-06 19:22:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2021-01-06 19:22:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-06 19:22:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2021-01-06 19:22:09,282 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 47 [2021-01-06 19:22:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:09,282 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2021-01-06 19:22:09,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 19:22:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2021-01-06 19:22:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 19:22:09,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:09,286 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2021-01-06 19:22:09,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:09,500 INFO L429 AbstractCegarLoop]: === Iteration 6 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1408716111, now seen corresponding path program 2 times [2021-01-06 19:22:09,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:09,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055282244] [2021-01-06 19:22:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:22:09,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055282244] [2021-01-06 19:22:09,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870026579] [2021-01-06 19:22:10,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:22:10,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:22:10,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:10,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 63 conjunts are in the unsatisfiable core [2021-01-06 19:22:10,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:10,143 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:10,145 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:10,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:10,152 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:10,154 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:10,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:10,161 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:10,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:1 [2021-01-06 19:22:10,403 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-01-06 19:22:10,404 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:10,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:10,411 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-01-06 19:22:10,412 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:10,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:10,416 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:10,416 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2021-01-06 19:22:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-06 19:22:10,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:10,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 25 [2021-01-06 19:22:10,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046494778] [2021-01-06 19:22:10,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 19:22:10,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:10,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 19:22:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2021-01-06 19:22:10,435 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand 25 states. [2021-01-06 19:22:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:11,678 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2021-01-06 19:22:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 19:22:11,679 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2021-01-06 19:22:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:11,682 INFO L225 Difference]: With dead ends: 116 [2021-01-06 19:22:11,682 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 19:22:11,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:22:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 19:22:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-01-06 19:22:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-06 19:22:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2021-01-06 19:22:11,703 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 57 [2021-01-06 19:22:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:11,704 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2021-01-06 19:22:11,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 19:22:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2021-01-06 19:22:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 19:22:11,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:11,708 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2021-01-06 19:22:11,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:11,921 INFO L429 AbstractCegarLoop]: === Iteration 7 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1292352465, now seen corresponding path program 2 times [2021-01-06 19:22:11,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:11,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873790958] [2021-01-06 19:22:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:22:12,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873790958] [2021-01-06 19:22:12,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407424515] [2021-01-06 19:22:12,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:22:12,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:22:12,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:12,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2021-01-06 19:22:12,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:12,476 INFO L382 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 13 treesize of output 9 [2021-01-06 19:22:12,477 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:12,480 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:12,481 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:12,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2021-01-06 19:22:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-06 19:22:12,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:12,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2021-01-06 19:22:12,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688804428] [2021-01-06 19:22:12,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-06 19:22:12,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-06 19:22:12,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2021-01-06 19:22:12,858 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand 30 states. [2021-01-06 19:22:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:22,924 INFO L93 Difference]: Finished difference Result 163 states and 231 transitions. [2021-01-06 19:22:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 19:22:22,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2021-01-06 19:22:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:22,927 INFO L225 Difference]: With dead ends: 163 [2021-01-06 19:22:22,927 INFO L226 Difference]: Without dead ends: 142 [2021-01-06 19:22:22,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=271, Invalid=2699, Unknown=0, NotChecked=0, Total=2970 [2021-01-06 19:22:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-06 19:22:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2021-01-06 19:22:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-06 19:22:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2021-01-06 19:22:22,960 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 57 [2021-01-06 19:22:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:22,961 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2021-01-06 19:22:22,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-06 19:22:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2021-01-06 19:22:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:22:22,964 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:22,964 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:23,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 19:22:23,178 INFO L429 AbstractCegarLoop]: === Iteration 8 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash -945278837, now seen corresponding path program 3 times [2021-01-06 19:22:23,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:23,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700106207] [2021-01-06 19:22:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-06 19:22:23,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700106207] [2021-01-06 19:22:23,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550903123] [2021-01-06 19:22:23,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:22:24,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-01-06 19:22:24,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:24,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 100 conjunts are in the unsatisfiable core [2021-01-06 19:22:24,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:24,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:22:24,179 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:24,184 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:24,187 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:22:24,188 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:24,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:24,200 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:24,200 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-06 19:22:25,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:25,248 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 19 [2021-01-06 19:22:25,249 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:25,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:25,265 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2021-01-06 19:22:25,266 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:25,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:25,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 19:22:25,278 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:28 [2021-01-06 19:22:25,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:25,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:25,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:25,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:25,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:22:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-01-06 19:22:25,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:25,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2021-01-06 19:22:25,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114926614] [2021-01-06 19:22:25,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-01-06 19:22:25,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-01-06 19:22:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2214, Unknown=0, NotChecked=0, Total=2352 [2021-01-06 19:22:25,681 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand 49 states. [2021-01-06 19:22:29,605 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2021-01-06 19:22:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:30,088 INFO L93 Difference]: Finished difference Result 223 states and 412 transitions. [2021-01-06 19:22:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-06 19:22:30,088 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 70 [2021-01-06 19:22:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:30,097 INFO L225 Difference]: With dead ends: 223 [2021-01-06 19:22:30,098 INFO L226 Difference]: Without dead ends: 221 [2021-01-06 19:22:30,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=512, Invalid=5650, Unknown=0, NotChecked=0, Total=6162 [2021-01-06 19:22:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-01-06 19:22:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 151. [2021-01-06 19:22:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-06 19:22:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 245 transitions. [2021-01-06 19:22:30,146 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 245 transitions. Word has length 70 [2021-01-06 19:22:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:30,147 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 245 transitions. [2021-01-06 19:22:30,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2021-01-06 19:22:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2021-01-06 19:22:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:22:30,152 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:30,152 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:30,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:30,368 INFO L429 AbstractCegarLoop]: === Iteration 9 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:30,369 INFO L82 PathProgramCache]: Analyzing trace with hash -909256420, now seen corresponding path program 1 times [2021-01-06 19:22:30,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:30,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075553276] [2021-01-06 19:22:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:30,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:31,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:31,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 31 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-06 19:22:31,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075553276] [2021-01-06 19:22:31,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20022124] [2021-01-06 19:22:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:31,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 75 conjunts are in the unsatisfiable core [2021-01-06 19:22:31,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:31,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:31,349 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:31,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:31,358 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:31,359 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:31,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:31,366 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:31,367 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2021-01-06 19:22:31,959 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 19 [2021-01-06 19:22:31,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:31,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:31,968 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2021-01-06 19:22:31,969 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:31,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:31,974 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:31,977 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2021-01-06 19:22:32,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:32,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:32,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-01-06 19:22:32,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:32,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19] total 44 [2021-01-06 19:22:32,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685114355] [2021-01-06 19:22:32,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-06 19:22:32,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-06 19:22:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1787, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:22:32,188 INFO L87 Difference]: Start difference. First operand 151 states and 245 transitions. Second operand 44 states. [2021-01-06 19:22:35,155 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-06 19:22:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:37,736 INFO L93 Difference]: Finished difference Result 324 states and 604 transitions. [2021-01-06 19:22:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-01-06 19:22:37,737 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71 [2021-01-06 19:22:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:37,742 INFO L225 Difference]: With dead ends: 324 [2021-01-06 19:22:37,742 INFO L226 Difference]: Without dead ends: 322 [2021-01-06 19:22:37,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=577, Invalid=6733, Unknown=0, NotChecked=0, Total=7310 [2021-01-06 19:22:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-01-06 19:22:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 152. [2021-01-06 19:22:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-01-06 19:22:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 247 transitions. [2021-01-06 19:22:37,780 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 247 transitions. Word has length 71 [2021-01-06 19:22:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:37,780 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 247 transitions. [2021-01-06 19:22:37,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-06 19:22:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 247 transitions. [2021-01-06 19:22:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:22:37,783 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:37,784 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:37,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:37,997 INFO L429 AbstractCegarLoop]: === Iteration 10 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1931785932, now seen corresponding path program 2 times [2021-01-06 19:22:37,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:37,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131411052] [2021-01-06 19:22:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-01-06 19:22:38,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131411052] [2021-01-06 19:22:38,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680881668] [2021-01-06 19:22:38,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:38,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:22:38,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:38,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:22:38,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:38,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:38,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-01-06 19:22:38,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:38,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-01-06 19:22:38,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441789422] [2021-01-06 19:22:38,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 19:22:38,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 19:22:38,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:22:38,521 INFO L87 Difference]: Start difference. First operand 152 states and 247 transitions. Second operand 19 states. [2021-01-06 19:22:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:39,825 INFO L93 Difference]: Finished difference Result 343 states and 703 transitions. [2021-01-06 19:22:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 19:22:39,826 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2021-01-06 19:22:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:39,830 INFO L225 Difference]: With dead ends: 343 [2021-01-06 19:22:39,830 INFO L226 Difference]: Without dead ends: 228 [2021-01-06 19:22:39,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=365, Invalid=1705, Unknown=0, NotChecked=0, Total=2070 [2021-01-06 19:22:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-01-06 19:22:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 183. [2021-01-06 19:22:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2021-01-06 19:22:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 309 transitions. [2021-01-06 19:22:39,859 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 309 transitions. Word has length 71 [2021-01-06 19:22:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:39,860 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 309 transitions. [2021-01-06 19:22:39,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 19:22:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 309 transitions. [2021-01-06 19:22:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:22:39,863 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:39,863 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:40,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 19:22:40,077 INFO L429 AbstractCegarLoop]: === Iteration 11 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1914561797, now seen corresponding path program 1 times [2021-01-06 19:22:40,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:40,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506399410] [2021-01-06 19:22:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:40,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-06 19:22:41,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506399410] [2021-01-06 19:22:41,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180376698] [2021-01-06 19:22:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:41,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 80 conjunts are in the unsatisfiable core [2021-01-06 19:22:41,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:41,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:41,141 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:41,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:41,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:41,151 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:41,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:41,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:41,157 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2021-01-06 19:22:41,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:41,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:41,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:41,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2021-01-06 19:22:41,956 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:41,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:41,964 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2021-01-06 19:22:41,965 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:41,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:41,971 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:41,971 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:13 [2021-01-06 19:22:42,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:42,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:42,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:22:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-01-06 19:22:42,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:42,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 47 [2021-01-06 19:22:42,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938416715] [2021-01-06 19:22:42,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-01-06 19:22:42,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:42,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-01-06 19:22:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2052, Unknown=0, NotChecked=0, Total=2162 [2021-01-06 19:22:42,247 INFO L87 Difference]: Start difference. First operand 183 states and 309 transitions. Second operand 47 states. [2021-01-06 19:22:45,354 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-01-06 19:22:45,746 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-01-06 19:22:46,111 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2021-01-06 19:22:46,369 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2021-01-06 19:22:46,585 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2021-01-06 19:22:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:48,210 INFO L93 Difference]: Finished difference Result 294 states and 546 transitions. [2021-01-06 19:22:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-01-06 19:22:48,211 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2021-01-06 19:22:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:48,216 INFO L225 Difference]: With dead ends: 294 [2021-01-06 19:22:48,216 INFO L226 Difference]: Without dead ends: 292 [2021-01-06 19:22:48,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=548, Invalid=5932, Unknown=0, NotChecked=0, Total=6480 [2021-01-06 19:22:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-01-06 19:22:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 196. [2021-01-06 19:22:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2021-01-06 19:22:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 351 transitions. [2021-01-06 19:22:48,250 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 351 transitions. Word has length 72 [2021-01-06 19:22:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:48,251 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 351 transitions. [2021-01-06 19:22:48,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2021-01-06 19:22:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 351 transitions. [2021-01-06 19:22:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:22:48,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:48,254 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:48,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:48,468 INFO L429 AbstractCegarLoop]: === Iteration 12 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:48,469 INFO L82 PathProgramCache]: Analyzing trace with hash 872853690, now seen corresponding path program 1 times [2021-01-06 19:22:48,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:48,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539113653] [2021-01-06 19:22:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:48,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:49,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:49,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:49,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 19:22:49,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539113653] [2021-01-06 19:22:49,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557413679] [2021-01-06 19:22:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:49,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 75 conjunts are in the unsatisfiable core [2021-01-06 19:22:49,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:49,299 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:49,300 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:49,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:49,307 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:49,308 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:49,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:49,313 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:49,314 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2021-01-06 19:22:49,862 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2021-01-06 19:22:49,863 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:49,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:49,870 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2021-01-06 19:22:49,873 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:49,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:49,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:49,875 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2021-01-06 19:22:50,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:50,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-01-06 19:22:50,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:50,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 42 [2021-01-06 19:22:50,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728687014] [2021-01-06 19:22:50,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-01-06 19:22:50,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-01-06 19:22:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1617, Unknown=0, NotChecked=0, Total=1722 [2021-01-06 19:22:50,064 INFO L87 Difference]: Start difference. First operand 196 states and 351 transitions. Second operand 42 states. [2021-01-06 19:22:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:52,886 INFO L93 Difference]: Finished difference Result 263 states and 462 transitions. [2021-01-06 19:22:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 19:22:52,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 72 [2021-01-06 19:22:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:52,891 INFO L225 Difference]: With dead ends: 263 [2021-01-06 19:22:52,891 INFO L226 Difference]: Without dead ends: 261 [2021-01-06 19:22:52,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=323, Invalid=3709, Unknown=0, NotChecked=0, Total=4032 [2021-01-06 19:22:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-01-06 19:22:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 179. [2021-01-06 19:22:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-06 19:22:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 304 transitions. [2021-01-06 19:22:52,919 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 304 transitions. Word has length 72 [2021-01-06 19:22:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:52,919 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 304 transitions. [2021-01-06 19:22:52,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2021-01-06 19:22:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 304 transitions. [2021-01-06 19:22:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:22:52,922 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:52,923 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:53,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:53,136 INFO L429 AbstractCegarLoop]: === Iteration 13 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:53,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1479239555, now seen corresponding path program 3 times [2021-01-06 19:22:53,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:53,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366491504] [2021-01-06 19:22:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:22:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-01-06 19:22:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-01-06 19:22:53,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366491504] [2021-01-06 19:22:53,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613863480] [2021-01-06 19:22:53,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:53,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 19:22:53,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:22:53,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 95 conjunts are in the unsatisfiable core [2021-01-06 19:22:53,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:53,899 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:53,900 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:53,904 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:53,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:53,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2021-01-06 19:22:53,940 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:22:53,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:53,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:53,951 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:22:53,951 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:53,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:53,960 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:53,960 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-01-06 19:22:54,319 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 15 [2021-01-06 19:22:54,321 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:54,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:54,327 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2021-01-06 19:22:54,328 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:54,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:54,335 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:54,335 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2021-01-06 19:22:54,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:54,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 29 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 19:22:54,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:54,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 33 [2021-01-06 19:22:54,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649096583] [2021-01-06 19:22:54,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-06 19:22:54,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-06 19:22:54,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 19:22:54,394 INFO L87 Difference]: Start difference. First operand 179 states and 304 transitions. Second operand 33 states. [2021-01-06 19:22:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:22:56,181 INFO L93 Difference]: Finished difference Result 215 states and 364 transitions. [2021-01-06 19:22:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 19:22:56,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2021-01-06 19:22:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:22:56,185 INFO L225 Difference]: With dead ends: 215 [2021-01-06 19:22:56,186 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 19:22:56,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=2679, Unknown=0, NotChecked=0, Total=2970 [2021-01-06 19:22:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 19:22:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2021-01-06 19:22:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-06 19:22:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 335 transitions. [2021-01-06 19:22:56,211 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 335 transitions. Word has length 70 [2021-01-06 19:22:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:22:56,211 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 335 transitions. [2021-01-06 19:22:56,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-06 19:22:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 335 transitions. [2021-01-06 19:22:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:22:56,214 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:22:56,214 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:22:56,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 19:22:56,428 INFO L429 AbstractCegarLoop]: === Iteration 14 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:22:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:22:56,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1086227410, now seen corresponding path program 1 times [2021-01-06 19:22:56,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:22:56,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130201363] [2021-01-06 19:22:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:22:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:22:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:22:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:22:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:56,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:22:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:57,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:57,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:22:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:57,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:22:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:57,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-01-06 19:22:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-01-06 19:22:57,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130201363] [2021-01-06 19:22:57,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089864908] [2021-01-06 19:22:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:22:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:22:57,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 83 conjunts are in the unsatisfiable core [2021-01-06 19:22:57,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:22:57,352 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:57,353 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:57,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:57,361 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:22:57,362 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:57,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:57,367 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:57,367 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:1 [2021-01-06 19:22:58,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 19 [2021-01-06 19:22:58,137 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:58,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:58,146 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2021-01-06 19:22:58,147 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:22:58,151 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:22:58,151 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:22:58,152 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2021-01-06 19:22:58,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:58,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:58,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:22:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-01-06 19:22:58,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:22:58,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 44 [2021-01-06 19:22:58,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249360441] [2021-01-06 19:22:58,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-06 19:22:58,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:22:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-06 19:22:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1787, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:22:58,403 INFO L87 Difference]: Start difference. First operand 198 states and 335 transitions. Second operand 44 states. [2021-01-06 19:23:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:09,106 INFO L93 Difference]: Finished difference Result 565 states and 1188 transitions. [2021-01-06 19:23:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-01-06 19:23:09,107 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71 [2021-01-06 19:23:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:09,115 INFO L225 Difference]: With dead ends: 565 [2021-01-06 19:23:09,115 INFO L226 Difference]: Without dead ends: 563 [2021-01-06 19:23:09,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4483 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1326, Invalid=15704, Unknown=0, NotChecked=0, Total=17030 [2021-01-06 19:23:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-01-06 19:23:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 331. [2021-01-06 19:23:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2021-01-06 19:23:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 731 transitions. [2021-01-06 19:23:09,188 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 731 transitions. Word has length 71 [2021-01-06 19:23:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:09,189 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 731 transitions. [2021-01-06 19:23:09,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-06 19:23:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 731 transitions. [2021-01-06 19:23:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:23:09,194 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:09,195 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:09,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 19:23:09,409 INFO L429 AbstractCegarLoop]: === Iteration 15 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1479346186, now seen corresponding path program 1 times [2021-01-06 19:23:09,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:09,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715608344] [2021-01-06 19:23:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:23:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:23:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:23:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:23:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:23:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:23:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:23:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:23:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:10,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:23:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:10,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:23:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-01-06 19:23:10,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715608344] [2021-01-06 19:23:10,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710769397] [2021-01-06 19:23:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:10,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 97 conjunts are in the unsatisfiable core [2021-01-06 19:23:10,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:10,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:23:10,347 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:23:10,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:23:10,359 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:23:10,360 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:23:10,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:23:10,368 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:23:10,369 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:19 [2021-01-06 19:23:12,922 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 19:23:15,044 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2021-01-06 19:23:17,232 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 19:23:17,809 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:23:17,809 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2021-01-06 19:23:17,811 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:23:17,813 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:23:17,814 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 19:23:17,832 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:23:17,842 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:23:17,842 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 46 [2021-01-06 19:23:17,844 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 19:23:17,845 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:23:17,847 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 19:23:17,853 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:23:17,876 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2021-01-06 19:23:17,879 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:23:17,880 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:7 [2021-01-06 19:23:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:23:17,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:17,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 44 [2021-01-06 19:23:17,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736173198] [2021-01-06 19:23:17,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-06 19:23:17,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:17,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-06 19:23:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1743, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:23:17,912 INFO L87 Difference]: Start difference. First operand 331 states and 731 transitions. Second operand 44 states. [2021-01-06 19:23:22,993 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2021-01-06 19:23:27,155 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2021-01-06 19:23:29,245 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2021-01-06 19:23:29,938 WARN L197 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-01-06 19:23:32,039 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 47 [2021-01-06 19:23:36,187 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2021-01-06 19:23:40,408 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2021-01-06 19:23:42,625 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 54 [2021-01-06 19:23:45,255 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 19:23:47,397 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 46 [2021-01-06 19:23:50,606 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2021-01-06 19:23:51,385 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-01-06 19:23:55,558 WARN L197 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-01-06 19:23:59,716 WARN L197 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-01-06 19:24:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:00,061 INFO L93 Difference]: Finished difference Result 540 states and 1237 transitions. [2021-01-06 19:24:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-06 19:24:00,067 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 76 [2021-01-06 19:24:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:00,076 INFO L225 Difference]: With dead ends: 540 [2021-01-06 19:24:00,076 INFO L226 Difference]: Without dead ends: 528 [2021-01-06 19:24:00,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=514, Invalid=5036, Unknown=0, NotChecked=0, Total=5550 [2021-01-06 19:24:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-01-06 19:24:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 444. [2021-01-06 19:24:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2021-01-06 19:24:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1017 transitions. [2021-01-06 19:24:00,163 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1017 transitions. Word has length 76 [2021-01-06 19:24:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:00,164 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1017 transitions. [2021-01-06 19:24:00,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-06 19:24:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1017 transitions. [2021-01-06 19:24:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:24:00,170 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:00,170 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:00,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 19:24:00,385 INFO L429 AbstractCegarLoop]: === Iteration 16 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1595709832, now seen corresponding path program 4 times [2021-01-06 19:24:00,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:00,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529374052] [2021-01-06 19:24:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:24:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:24:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:24:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:24:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:24:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-01-06 19:24:00,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529374052] [2021-01-06 19:24:00,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325836178] [2021-01-06 19:24:00,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:01,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:24:01,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:24:01,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 99 conjunts are in the unsatisfiable core [2021-01-06 19:24:01,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:01,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:24:01,210 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:01,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:01,219 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:24:01,220 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:01,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:01,228 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:01,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-01-06 19:24:02,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 19:24:02,063 INFO L348 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-01-06 19:24:02,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2021-01-06 19:24:02,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:24:02,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:24:02,067 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 19:24:02,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:02,104 INFO L348 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-01-06 19:24:02,105 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2021-01-06 19:24:02,106 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:02,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:02,117 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:02,117 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:7 [2021-01-06 19:24:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 19:24:02,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:02,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 36 [2021-01-06 19:24:02,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260054118] [2021-01-06 19:24:02,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-01-06 19:24:02,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:02,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-01-06 19:24:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2021-01-06 19:24:02,156 INFO L87 Difference]: Start difference. First operand 444 states and 1017 transitions. Second operand 36 states. [2021-01-06 19:24:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:06,693 INFO L93 Difference]: Finished difference Result 1221 states and 3477 transitions. [2021-01-06 19:24:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-01-06 19:24:06,694 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2021-01-06 19:24:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:06,710 INFO L225 Difference]: With dead ends: 1221 [2021-01-06 19:24:06,711 INFO L226 Difference]: Without dead ends: 874 [2021-01-06 19:24:06,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=469, Invalid=4933, Unknown=0, NotChecked=0, Total=5402 [2021-01-06 19:24:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-01-06 19:24:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 706. [2021-01-06 19:24:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2021-01-06 19:24:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1905 transitions. [2021-01-06 19:24:06,856 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1905 transitions. Word has length 76 [2021-01-06 19:24:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:06,857 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1905 transitions. [2021-01-06 19:24:06,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2021-01-06 19:24:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1905 transitions. [2021-01-06 19:24:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:24:06,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:06,866 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:07,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:07,080 INFO L429 AbstractCegarLoop]: === Iteration 17 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash 191480931, now seen corresponding path program 1 times [2021-01-06 19:24:07,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:07,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873954375] [2021-01-06 19:24:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:24:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:24:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:24:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:24:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 19:24:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-01-06 19:24:08,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873954375] [2021-01-06 19:24:08,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476594316] [2021-01-06 19:24:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:08,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 94 conjunts are in the unsatisfiable core [2021-01-06 19:24:08,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:08,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:24:08,136 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:08,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:08,144 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:24:08,145 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:08,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:08,151 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:08,151 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:1 [2021-01-06 19:24:08,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:24:08,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:24:08,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:24:08,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:24:09,510 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 17 [2021-01-06 19:24:09,511 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:09,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:09,521 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2021-01-06 19:24:09,523 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:09,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:09,529 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:09,529 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:13 [2021-01-06 19:24:09,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:24:09,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:24:09,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:24:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-01-06 19:24:09,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:09,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 53 [2021-01-06 19:24:09,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841697862] [2021-01-06 19:24:09,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-01-06 19:24:09,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-01-06 19:24:09,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2616, Unknown=0, NotChecked=0, Total=2756 [2021-01-06 19:24:09,854 INFO L87 Difference]: Start difference. First operand 706 states and 1905 transitions. Second operand 53 states. [2021-01-06 19:24:15,546 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2021-01-06 19:24:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:15,879 INFO L93 Difference]: Finished difference Result 800 states and 2235 transitions. [2021-01-06 19:24:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-01-06 19:24:15,880 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 72 [2021-01-06 19:24:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:15,894 INFO L225 Difference]: With dead ends: 800 [2021-01-06 19:24:15,894 INFO L226 Difference]: Without dead ends: 798 [2021-01-06 19:24:15,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=732, Invalid=8010, Unknown=0, NotChecked=0, Total=8742 [2021-01-06 19:24:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-01-06 19:24:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 706. [2021-01-06 19:24:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2021-01-06 19:24:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1905 transitions. [2021-01-06 19:24:16,057 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1905 transitions. Word has length 72 [2021-01-06 19:24:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:16,058 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1905 transitions. [2021-01-06 19:24:16,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2021-01-06 19:24:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1905 transitions. [2021-01-06 19:24:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:24:16,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:16,070 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:16,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 19:24:16,286 INFO L429 AbstractCegarLoop]: === Iteration 18 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash 181678716, now seen corresponding path program 4 times [2021-01-06 19:24:16,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:16,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126132411] [2021-01-06 19:24:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:24:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:24:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:16,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:24:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:24:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-01-06 19:24:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-01-06 19:24:17,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126132411] [2021-01-06 19:24:17,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52863238] [2021-01-06 19:24:17,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:17,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:24:17,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:24:17,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 94 conjunts are in the unsatisfiable core [2021-01-06 19:24:17,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:17,366 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:24:17,367 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:17,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:17,370 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:17,370 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:1 [2021-01-06 19:24:17,380 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:24:17,380 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:17,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:17,389 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:24:17,389 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:17,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:17,396 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:17,396 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:1 [2021-01-06 19:24:18,439 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:18,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2021-01-06 19:24:18,441 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:24:18,442 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:24:18,444 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 19:24:18,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:18,468 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:18,468 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 38 [2021-01-06 19:24:18,469 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 19:24:18,471 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 19:24:18,473 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:18,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:18,477 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:18,478 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2021-01-06 19:24:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-01-06 19:24:18,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:18,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 39 [2021-01-06 19:24:18,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250661126] [2021-01-06 19:24:18,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-06 19:24:18,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-06 19:24:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 19:24:18,528 INFO L87 Difference]: Start difference. First operand 706 states and 1905 transitions. Second operand 39 states. [2021-01-06 19:24:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:26,938 INFO L93 Difference]: Finished difference Result 1273 states and 4505 transitions. [2021-01-06 19:24:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-01-06 19:24:26,939 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2021-01-06 19:24:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:26,965 INFO L225 Difference]: With dead ends: 1273 [2021-01-06 19:24:26,965 INFO L226 Difference]: Without dead ends: 1256 [2021-01-06 19:24:26,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=552, Invalid=5148, Unknown=0, NotChecked=0, Total=5700 [2021-01-06 19:24:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2021-01-06 19:24:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1161. [2021-01-06 19:24:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2021-01-06 19:24:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4244 transitions. [2021-01-06 19:24:27,458 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4244 transitions. Word has length 76 [2021-01-06 19:24:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:27,459 INFO L481 AbstractCegarLoop]: Abstraction has 1161 states and 4244 transitions. [2021-01-06 19:24:27,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-06 19:24:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4244 transitions. [2021-01-06 19:24:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:24:27,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:27,473 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:27,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 19:24:27,686 INFO L429 AbstractCegarLoop]: === Iteration 19 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash 298042362, now seen corresponding path program 2 times [2021-01-06 19:24:27,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:27,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003204822] [2021-01-06 19:24:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:27,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:24:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:24:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 19:24:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-06 19:24:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:24:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:24:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-01-06 19:24:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 31 proven. 32 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-06 19:24:28,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003204822] [2021-01-06 19:24:28,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189938033] [2021-01-06 19:24:28,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:28,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:24:28,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:24:28,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 97 conjunts are in the unsatisfiable core [2021-01-06 19:24:28,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:28,899 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 19:24:28,900 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:28,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:28,908 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:28,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2021-01-06 19:24:28,978 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 19:24:28,978 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2021-01-06 19:24:28,980 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:28,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:28,989 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:28,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2021-01-06 19:24:31,660 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 19:24:33,762 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2021-01-06 19:24:35,973 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2021-01-06 19:24:36,723 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:36,723 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2021-01-06 19:24:36,725 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:24:36,726 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:24:36,727 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 19:24:36,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:36,758 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:36,759 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 46 [2021-01-06 19:24:36,761 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 19:24:36,761 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 19:24:36,767 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 19:24:36,770 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:24:36,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:24:36,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:24:36,783 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:7 [2021-01-06 19:24:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:24:36,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:36,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 47 [2021-01-06 19:24:36,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082702872] [2021-01-06 19:24:36,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-01-06 19:24:36,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-01-06 19:24:36,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2006, Unknown=0, NotChecked=0, Total=2162 [2021-01-06 19:24:36,829 INFO L87 Difference]: Start difference. First operand 1161 states and 4244 transitions. Second operand 47 states. [2021-01-06 19:24:45,940 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 45 [2021-01-06 19:24:46,805 WARN L197 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-01-06 19:24:49,407 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2021-01-06 19:24:51,526 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2021-01-06 19:24:53,650 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 19:24:57,190 WARN L197 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2021-01-06 19:24:59,475 WARN L197 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2021-01-06 19:25:02,753 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 48 [2021-01-06 19:25:04,872 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 52 [2021-01-06 19:25:09,052 WARN L197 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 19:25:09,625 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-06 19:25:09,985 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-01-06 19:25:13,567 WARN L197 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 61 [2021-01-06 19:25:17,669 WARN L197 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 57 [2021-01-06 19:25:21,933 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2021-01-06 19:25:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:25,346 INFO L93 Difference]: Finished difference Result 2046 states and 10099 transitions. [2021-01-06 19:25:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-01-06 19:25:25,347 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 76 [2021-01-06 19:25:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:25,421 INFO L225 Difference]: With dead ends: 2046 [2021-01-06 19:25:25,421 INFO L226 Difference]: Without dead ends: 2021 [2021-01-06 19:25:25,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=771, Invalid=7971, Unknown=0, NotChecked=0, Total=8742 [2021-01-06 19:25:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2021-01-06 19:25:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1575. [2021-01-06 19:25:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2021-01-06 19:25:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 6842 transitions. [2021-01-06 19:25:26,484 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 6842 transitions. Word has length 76 [2021-01-06 19:25:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:26,485 INFO L481 AbstractCegarLoop]: Abstraction has 1575 states and 6842 transitions. [2021-01-06 19:25:26,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2021-01-06 19:25:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 6842 transitions. [2021-01-06 19:25:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:25:26,511 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:26,511 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:26,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:25:26,726 INFO L429 AbstractCegarLoop]: === Iteration 20 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash -560347655, now seen corresponding path program 5 times [2021-01-06 19:25:26,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:26,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731906465] [2021-01-06 19:25:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:25:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:25:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:25:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:25:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:25:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:25:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:25:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-01-06 19:25:28,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731906465] [2021-01-06 19:25:28,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447114361] [2021-01-06 19:25:28,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:25:28,365 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-01-06 19:25:28,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:25:28,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 127 conjunts are in the unsatisfiable core [2021-01-06 19:25:28,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:25:28,462 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:25:28,463 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:28,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:28,473 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:25:28,474 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:28,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:28,483 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:25:28,483 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-01-06 19:25:31,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-06 19:25:31,059 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:31,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 47 [2021-01-06 19:25:31,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:25:31,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:25:31,066 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 19:25:31,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:31,092 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:31,092 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2021-01-06 19:25:31,094 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:31,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:31,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:31,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:31,119 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:25:31,120 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:15 [2021-01-06 19:25:31,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:31,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:31,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 42 proven. 67 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 19:25:31,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:25:31,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 59 [2021-01-06 19:25:31,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926290212] [2021-01-06 19:25:31,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-01-06 19:25:31,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:31,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-01-06 19:25:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3236, Unknown=0, NotChecked=0, Total=3422 [2021-01-06 19:25:31,502 INFO L87 Difference]: Start difference. First operand 1575 states and 6842 transitions. Second operand 59 states. [2021-01-06 19:25:36,528 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-01-06 19:25:36,886 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-01-06 19:25:38,969 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-01-06 19:25:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:41,543 INFO L93 Difference]: Finished difference Result 2516 states and 13945 transitions. [2021-01-06 19:25:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-01-06 19:25:41,544 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 99 [2021-01-06 19:25:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:41,630 INFO L225 Difference]: With dead ends: 2516 [2021-01-06 19:25:41,631 INFO L226 Difference]: Without dead ends: 2514 [2021-01-06 19:25:41,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1169, Invalid=12873, Unknown=0, NotChecked=0, Total=14042 [2021-01-06 19:25:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2021-01-06 19:25:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1821. [2021-01-06 19:25:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2021-01-06 19:25:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 8234 transitions. [2021-01-06 19:25:42,563 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 8234 transitions. Word has length 99 [2021-01-06 19:25:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:42,564 INFO L481 AbstractCegarLoop]: Abstraction has 1821 states and 8234 transitions. [2021-01-06 19:25:42,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2021-01-06 19:25:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 8234 transitions. [2021-01-06 19:25:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:25:42,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:42,596 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:42,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:25:42,798 INFO L429 AbstractCegarLoop]: === Iteration 21 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash -285986040, now seen corresponding path program 3 times [2021-01-06 19:25:42,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:42,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985374941] [2021-01-06 19:25:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:25:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:25:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:25:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:25:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:25:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:25:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:43,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:25:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:44,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:44,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:44,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:44,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:45,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:25:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:45,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:25:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 50 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-01-06 19:25:45,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985374941] [2021-01-06 19:25:45,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531096562] [2021-01-06 19:25:45,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:25:45,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-01-06 19:25:45,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:25:45,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 140 conjunts are in the unsatisfiable core [2021-01-06 19:25:45,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:25:45,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:25:45,915 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:45,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:45,931 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-01-06 19:25:45,932 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:45,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:45,944 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 19:25:45,944 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:45,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:45,953 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 19:25:45,953 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2021-01-06 19:25:49,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:50,336 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 4=[|#memory_$Pointer$.base|]} [2021-01-06 19:25:50,348 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:50,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-01-06 19:25:50,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:50,371 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:50,381 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:50,382 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 35 [2021-01-06 19:25:50,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:50,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:50,388 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 19:25:50,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 19:25:50,396 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 19:25:50,396 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:22 [2021-01-06 19:25:50,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:50,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:25:50,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:25:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 54 proven. 71 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-01-06 19:25:51,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:25:51,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38] total 75 [2021-01-06 19:25:51,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568859320] [2021-01-06 19:25:51,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-01-06 19:25:51,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-01-06 19:25:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=5286, Unknown=0, NotChecked=0, Total=5550 [2021-01-06 19:25:51,031 INFO L87 Difference]: Start difference. First operand 1821 states and 8234 transitions. Second operand 75 states. [2021-01-06 19:25:54,723 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58