/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-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 17:36:34,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 17:36:34,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 17:36:34,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 17:36:34,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 17:36:34,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 17:36:34,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 17:36:34,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 17:36:34,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 17:36:34,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 17:36:34,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 17:36:34,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 17:36:34,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 17:36:34,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 17:36:34,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 17:36:34,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 17:36:34,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 17:36:34,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 17:36:35,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 17:36:35,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 17:36:35,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 17:36:35,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 17:36:35,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 17:36:35,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 17:36:35,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 17:36:35,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 17:36:35,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 17:36:35,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 17:36:35,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 17:36:35,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 17:36:35,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 17:36:35,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 17:36:35,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 17:36:35,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 17:36:35,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 17:36:35,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 17:36:35,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 17:36:35,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 17:36:35,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 17:36:35,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 17:36:35,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 17:36:35,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-12-23 17:36:35,108 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 17:36:35,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 17:36:35,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 17:36:35,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 17:36:35,115 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 17:36:35,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 17:36:35,115 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-23 17:36:35,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 17:36:35,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 17:36:35,116 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-23 17:36:35,116 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-23 17:36:35,116 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-23 17:36:35,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 17:36:35,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-23 17:36:35,117 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 17:36:35,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 17:36:35,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 17:36:35,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 17:36:35,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 17:36:35,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 17:36:35,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 17:36:35,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 17:36:35,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 17:36:35,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 17:36:35,120 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 [2020-12-23 17:36:35,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 17:36:35,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 17:36:35,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 17:36:35,569 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 17:36:35,569 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 17:36:35,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-12-23 17:36:35,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eead71714/c07484ce904b4b218c5b6fc4caf86c55/FLAG3d52c8db9 [2020-12-23 17:36:36,399 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 17:36:36,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-12-23 17:36:36,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eead71714/c07484ce904b4b218c5b6fc4caf86c55/FLAG3d52c8db9 [2020-12-23 17:36:36,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eead71714/c07484ce904b4b218c5b6fc4caf86c55 [2020-12-23 17:36:36,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 17:36:36,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 17:36:36,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 17:36:36,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 17:36:36,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 17:36:36,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:36:36" (1/1) ... [2020-12-23 17:36:36,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40763cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:36, skipping insertion in model container [2020-12-23 17:36:36,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 05:36:36" (1/1) ... [2020-12-23 17:36:36,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 17:36:36,809 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] [2020-12-23 17:36:37,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:36:37,048 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x0~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x1~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x2~0,] left hand side expression in assignment: address: IdentifierExpression[~x3~0,] [2020-12-23 17:36:37,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 17:36:37,085 INFO L208 MainTranslator]: Completed translation [2020-12-23 17:36:37,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37 WrapperNode [2020-12-23 17:36:37,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 17:36:37,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 17:36:37,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 17:36:37,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 17:36:37,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 17:36:37,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 17:36:37,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 17:36:37,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 17:36:37,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (1/1) ... [2020-12-23 17:36:37,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 17:36:37,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 17:36:37,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 17:36:37,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 17:36:37,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (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 [2020-12-23 17:36:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 17:36:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 17:36:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 17:36:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 17:36:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 17:36:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 17:36:38,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 17:36:38,118 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2020-12-23 17:36:38,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:36:38 BoogieIcfgContainer [2020-12-23 17:36:38,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 17:36:38,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 17:36:38,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 17:36:38,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 17:36:38,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 05:36:36" (1/3) ... [2020-12-23 17:36:38,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cd8451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:36:38, skipping insertion in model container [2020-12-23 17:36:38,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 05:36:37" (2/3) ... [2020-12-23 17:36:38,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cd8451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 05:36:38, skipping insertion in model container [2020-12-23 17:36:38,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:36:38" (3/3) ... [2020-12-23 17:36:38,136 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-12-23 17:36:38,144 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 17:36:38,152 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2020-12-23 17:36:38,175 INFO L253 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2020-12-23 17:36:38,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 17:36:38,201 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-23 17:36:38,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 17:36:38,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 17:36:38,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 17:36:38,201 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 17:36:38,202 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 17:36:38,202 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 17:36:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-12-23 17:36:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:36:38,226 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:38,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:36:38,228 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-12-23 17:36:38,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:38,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122821650] [2020-12-23 17:36:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:38,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122821650] [2020-12-23 17:36:38,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:38,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:38,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144312180] [2020-12-23 17:36:38,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:38,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:38,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:38,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:38,504 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2020-12-23 17:36:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:38,604 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-12-23 17:36:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:38,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:36:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:38,617 INFO L225 Difference]: With dead ends: 52 [2020-12-23 17:36:38,618 INFO L226 Difference]: Without dead ends: 50 [2020-12-23 17:36:38,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-23 17:36:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-12-23 17:36:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-12-23 17:36:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-12-23 17:36:38,662 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2020-12-23 17:36:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:38,662 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-12-23 17:36:38,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-12-23 17:36:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 17:36:38,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:38,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 17:36:38,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 17:36:38,664 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-12-23 17:36:38,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:38,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083102872] [2020-12-23 17:36:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:38,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083102872] [2020-12-23 17:36:38,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:38,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:38,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599366083] [2020-12-23 17:36:38,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:38,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:38,778 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 3 states. [2020-12-23 17:36:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:38,877 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2020-12-23 17:36:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:38,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 17:36:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:38,879 INFO L225 Difference]: With dead ends: 46 [2020-12-23 17:36:38,879 INFO L226 Difference]: Without dead ends: 46 [2020-12-23 17:36:38,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-23 17:36:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-23 17:36:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-23 17:36:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-12-23 17:36:38,890 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2020-12-23 17:36:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:38,893 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-12-23 17:36:38,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-12-23 17:36:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-23 17:36:38,894 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:38,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-23 17:36:38,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 17:36:38,896 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2020-12-23 17:36:38,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:38,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584772472] [2020-12-23 17:36:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:38,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584772472] [2020-12-23 17:36:38,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:38,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:38,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042037831] [2020-12-23 17:36:38,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:38,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:39,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,000 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2020-12-23 17:36:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,105 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-12-23 17:36:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:39,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-23 17:36:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:39,112 INFO L225 Difference]: With dead ends: 42 [2020-12-23 17:36:39,112 INFO L226 Difference]: Without dead ends: 42 [2020-12-23 17:36:39,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-23 17:36:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-12-23 17:36:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-23 17:36:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-12-23 17:36:39,131 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2020-12-23 17:36:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:39,132 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-12-23 17:36:39,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-12-23 17:36:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-23 17:36:39,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:39,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-23 17:36:39,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 17:36:39,136 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2020-12-23 17:36:39,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:39,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838165875] [2020-12-23 17:36:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:39,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838165875] [2020-12-23 17:36:39,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:39,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:39,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285177636] [2020-12-23 17:36:39,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:39,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,200 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 3 states. [2020-12-23 17:36:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,244 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-12-23 17:36:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:39,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-23 17:36:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:39,246 INFO L225 Difference]: With dead ends: 38 [2020-12-23 17:36:39,246 INFO L226 Difference]: Without dead ends: 38 [2020-12-23 17:36:39,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-23 17:36:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-23 17:36:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-23 17:36:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2020-12-23 17:36:39,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2020-12-23 17:36:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:39,253 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-12-23 17:36:39,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-12-23 17:36:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-23 17:36:39,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:39,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-23 17:36:39,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 17:36:39,254 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2020-12-23 17:36:39,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:39,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413798646] [2020-12-23 17:36:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:39,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413798646] [2020-12-23 17:36:39,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:39,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:39,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739024359] [2020-12-23 17:36:39,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:39,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,293 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2020-12-23 17:36:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,339 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-12-23 17:36:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:39,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-23 17:36:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:39,341 INFO L225 Difference]: With dead ends: 34 [2020-12-23 17:36:39,341 INFO L226 Difference]: Without dead ends: 34 [2020-12-23 17:36:39,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-23 17:36:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-12-23 17:36:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-23 17:36:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-12-23 17:36:39,347 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2020-12-23 17:36:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:39,347 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-12-23 17:36:39,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-12-23 17:36:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-23 17:36:39,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:39,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-23 17:36:39,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 17:36:39,349 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2020-12-23 17:36:39,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:39,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346937640] [2020-12-23 17:36:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:39,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346937640] [2020-12-23 17:36:39,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:39,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:39,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840883547] [2020-12-23 17:36:39,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:39,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:39,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:39,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,399 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 3 states. [2020-12-23 17:36:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,465 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-12-23 17:36:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:39,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-23 17:36:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:39,470 INFO L225 Difference]: With dead ends: 30 [2020-12-23 17:36:39,471 INFO L226 Difference]: Without dead ends: 30 [2020-12-23 17:36:39,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-23 17:36:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-12-23 17:36:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-23 17:36:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-12-23 17:36:39,488 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2020-12-23 17:36:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:39,488 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-12-23 17:36:39,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-12-23 17:36:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-23 17:36:39,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:39,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-23 17:36:39,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 17:36:39,491 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2020-12-23 17:36:39,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:39,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324001538] [2020-12-23 17:36:39,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:39,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324001538] [2020-12-23 17:36:39,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:39,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:39,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28059174] [2020-12-23 17:36:39,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:39,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,582 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2020-12-23 17:36:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,649 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-12-23 17:36:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:39,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-23 17:36:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:39,653 INFO L225 Difference]: With dead ends: 27 [2020-12-23 17:36:39,653 INFO L226 Difference]: Without dead ends: 27 [2020-12-23 17:36:39,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-23 17:36:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-23 17:36:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-23 17:36:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-12-23 17:36:39,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2020-12-23 17:36:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:39,675 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-12-23 17:36:39,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-12-23 17:36:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-23 17:36:39,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:39,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-23 17:36:39,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 17:36:39,677 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2020-12-23 17:36:39,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:39,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262989752] [2020-12-23 17:36:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:39,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262989752] [2020-12-23 17:36:39,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:39,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 17:36:39,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047125076] [2020-12-23 17:36:39,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 17:36:39,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:39,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 17:36:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,766 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2020-12-23 17:36:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,799 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-12-23 17:36:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 17:36:39,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-23 17:36:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:39,802 INFO L225 Difference]: With dead ends: 24 [2020-12-23 17:36:39,802 INFO L226 Difference]: Without dead ends: 24 [2020-12-23 17:36:39,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 17:36:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-23 17:36:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-23 17:36:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-23 17:36:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2020-12-23 17:36:39,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2020-12-23 17:36:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:39,806 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-12-23 17:36:39,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 17:36:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-12-23 17:36:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 17:36:39,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:39,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:36:39,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 17:36:39,812 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2020-12-23 17:36:39,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:39,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30290744] [2020-12-23 17:36:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:39,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30290744] [2020-12-23 17:36:39,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 17:36:39,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 17:36:39,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393690431] [2020-12-23 17:36:39,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 17:36:39,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 17:36:39,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 17:36:39,901 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 4 states. [2020-12-23 17:36:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:39,998 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-12-23 17:36:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 17:36:39,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-23 17:36:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:40,000 INFO L225 Difference]: With dead ends: 39 [2020-12-23 17:36:40,000 INFO L226 Difference]: Without dead ends: 39 [2020-12-23 17:36:40,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 17:36:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-23 17:36:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2020-12-23 17:36:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-23 17:36:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-23 17:36:40,010 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2020-12-23 17:36:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:40,010 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-23 17:36:40,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 17:36:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-23 17:36:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 17:36:40,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:40,016 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:36:40,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 17:36:40,017 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:40,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2020-12-23 17:36:40,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:40,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371625808] [2020-12-23 17:36:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:40,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371625808] [2020-12-23 17:36:40,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215217586] [2020-12-23 17:36:40,227 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 [2020-12-23 17:36:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:40,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 17:36:40,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:36:40,405 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-12-23 17:36:40,415 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:40,428 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2020-12-23 17:36:40,450 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 11 treesize of output 7 [2020-12-23 17:36:40,451 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:40,458 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-23 17:36:40,491 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 19 treesize of output 18 [2020-12-23 17:36:40,493 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:40,503 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:36:40,504 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-12-23 17:36:40,575 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:36:40,578 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:40,586 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:40,587 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-12-23 17:36:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:40,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:36:40,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-12-23 17:36:40,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305215770] [2020-12-23 17:36:40,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:36:40,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:40,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:36:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 17:36:40,593 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2020-12-23 17:36:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:40,751 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-12-23 17:36:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 17:36:40,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-12-23 17:36:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:40,752 INFO L225 Difference]: With dead ends: 32 [2020-12-23 17:36:40,752 INFO L226 Difference]: Without dead ends: 32 [2020-12-23 17:36:40,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 17:36:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-23 17:36:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-12-23 17:36:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-23 17:36:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-23 17:36:40,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2020-12-23 17:36:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:40,756 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-23 17:36:40,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:36:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-23 17:36:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 17:36:40,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:40,757 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:36:40,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 17:36:40,972 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:40,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2020-12-23 17:36:40,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:40,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675561940] [2020-12-23 17:36:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:41,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675561940] [2020-12-23 17:36:41,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407987969] [2020-12-23 17:36:41,287 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 [2020-12-23 17:36:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:41,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-23 17:36:41,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:36:41,386 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-12-23 17:36:41,394 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:41,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:41,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:41,407 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2020-12-23 17:36:41,440 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 11 treesize of output 7 [2020-12-23 17:36:41,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:41,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:41,449 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:41,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-12-23 17:36:41,558 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:41,558 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2020-12-23 17:36:41,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,566 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:41,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:41,578 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:36:41,578 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-12-23 17:36:41,652 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:41,653 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2020-12-23 17:36:41,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:41,691 INFO L625 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2020-12-23 17:36:41,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:41,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:41,708 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 17:36:41,709 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:41 [2020-12-23 17:36:41,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:41,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:41,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:43,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:43,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:43,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:43,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:43,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:43,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:43,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 17:36:43,519 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:36:43,521 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:43,532 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:43,533 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2020-12-23 17:36:43,536 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:43,550 INFO L625 ElimStorePlain]: treesize reduction 22, result has 26.7 percent of original size [2020-12-23 17:36:43,552 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:43,553 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:3 [2020-12-23 17:36:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:43,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:36:43,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-12-23 17:36:43,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102646509] [2020-12-23 17:36:43,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 17:36:43,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 17:36:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=173, Unknown=3, NotChecked=0, Total=240 [2020-12-23 17:36:43,561 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 16 states. [2020-12-23 17:36:52,867 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-12-23 17:36:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:36:55,875 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-12-23 17:36:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 17:36:55,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-12-23 17:36:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:36:55,877 INFO L225 Difference]: With dead ends: 37 [2020-12-23 17:36:55,877 INFO L226 Difference]: Without dead ends: 37 [2020-12-23 17:36:55,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=192, Invalid=447, Unknown=11, NotChecked=0, Total=650 [2020-12-23 17:36:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-23 17:36:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-12-23 17:36:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-23 17:36:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-12-23 17:36:55,881 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 18 [2020-12-23 17:36:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:36:55,881 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-12-23 17:36:55,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 17:36:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-12-23 17:36:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 17:36:55,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:36:55,882 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:36:56,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:36:56,084 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:36:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:36:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1201930977, now seen corresponding path program 1 times [2020-12-23 17:36:56,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:36:56,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70737506] [2020-12-23 17:36:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:36:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:56,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70737506] [2020-12-23 17:36:56,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044669910] [2020-12-23 17:36:56,456 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 [2020-12-23 17:36:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:36:56,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 17:36:56,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:36:56,563 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-12-23 17:36:56,565 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:56,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:56,580 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:56,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2020-12-23 17:36:56,641 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 11 treesize of output 7 [2020-12-23 17:36:56,643 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:56,669 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:56,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:56,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-12-23 17:36:56,838 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:56,839 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2020-12-23 17:36:56,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:56,848 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:56,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:56,862 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:36:56,863 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2020-12-23 17:36:57,037 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:57,038 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 80 [2020-12-23 17:36:57,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:57,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:57,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:36:57,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2020-12-23 17:36:57,330 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:57,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 86 [2020-12-23 17:36:57,346 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:57,415 INFO L625 ElimStorePlain]: treesize reduction 32, result has 66.7 percent of original size [2020-12-23 17:36:57,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:36:57,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:36:57,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:36:57,483 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 17:36:57,484 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:64 [2020-12-23 17:36:57,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:36:57,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:36:57,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:36:57,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:36:57,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:36:57,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:36:57,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:36:57,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 17:36:57,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:36:57,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:36:57,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:36:57,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 17:36:57,704 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:36:57,704 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2020-12-23 17:36:57,707 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:57,717 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-12-23 17:36:57,719 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:57,725 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-12-23 17:36:57,727 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:36:57,770 INFO L625 ElimStorePlain]: treesize reduction 38, result has 46.5 percent of original size [2020-12-23 17:36:57,773 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:36:57,774 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:135, output treesize:3 [2020-12-23 17:36:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:36:57,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:36:57,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2020-12-23 17:36:57,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569662938] [2020-12-23 17:36:57,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 17:36:57,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:36:57,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 17:36:57,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-12-23 17:36:57,783 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 20 states. [2020-12-23 17:37:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:37:22,670 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-12-23 17:37:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 17:37:22,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2020-12-23 17:37:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:37:22,672 INFO L225 Difference]: With dead ends: 57 [2020-12-23 17:37:22,672 INFO L226 Difference]: Without dead ends: 57 [2020-12-23 17:37:22,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=470, Invalid=1422, Unknown=0, NotChecked=0, Total=1892 [2020-12-23 17:37:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-23 17:37:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2020-12-23 17:37:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-23 17:37:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-12-23 17:37:22,676 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2020-12-23 17:37:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:37:22,677 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-12-23 17:37:22,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 17:37:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-12-23 17:37:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 17:37:22,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:37:22,678 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:37:22,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 17:37:22,889 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:37:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:37:22,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1063171374, now seen corresponding path program 1 times [2020-12-23 17:37:22,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:37:22,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290024520] [2020-12-23 17:37:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:37:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:37:23,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290024520] [2020-12-23 17:37:23,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053923275] [2020-12-23 17:37:23,236 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 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 [2020-12-23 17:37:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:23,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-23 17:37:23,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:37:23,337 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 [2020-12-23 17:37:23,338 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:23,349 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-12-23 17:37:23,398 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:23,399 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 19 treesize of output 34 [2020-12-23 17:37:23,401 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,424 INFO L625 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2020-12-23 17:37:23,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:37:23,426 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-12-23 17:37:23,487 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:23,487 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 19 treesize of output 34 [2020-12-23 17:37:23,489 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,509 INFO L625 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2020-12-23 17:37:23,510 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:37:23,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2020-12-23 17:37:23,563 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:23,564 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 19 treesize of output 34 [2020-12-23 17:37:23,566 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,582 INFO L625 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2020-12-23 17:37:23,584 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:37:23,584 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2020-12-23 17:37:23,623 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 15 treesize of output 7 [2020-12-23 17:37:23,624 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:23,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:23,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-23 17:37:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:37:23,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 17:37:23,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2020-12-23 17:37:23,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652639758] [2020-12-23 17:37:23,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 17:37:23,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:37:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 17:37:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-12-23 17:37:23,653 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2020-12-23 17:37:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:37:23,751 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-12-23 17:37:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 17:37:23,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-23 17:37:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:37:23,752 INFO L225 Difference]: With dead ends: 48 [2020-12-23 17:37:23,752 INFO L226 Difference]: Without dead ends: 48 [2020-12-23 17:37:23,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-12-23 17:37:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-23 17:37:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2020-12-23 17:37:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-23 17:37:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-12-23 17:37:23,756 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 22 [2020-12-23 17:37:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:37:23,757 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-12-23 17:37:23,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 17:37:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-12-23 17:37:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 17:37:23,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:37:23,758 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:37:23,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:37:23,972 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:37:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:37:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2020-12-23 17:37:23,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:37:23,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614515] [2020-12-23 17:37:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:37:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:37:24,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614515] [2020-12-23 17:37:24,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125485350] [2020-12-23 17:37:24,238 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 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 [2020-12-23 17:37:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:24,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-23 17:37:24,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:37:24,327 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 [2020-12-23 17:37:24,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-12-23 17:37:24,376 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,377 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 19 treesize of output 34 [2020-12-23 17:37:24,378 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,405 INFO L625 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2020-12-23 17:37:24,406 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-12-23 17:37:24,483 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,484 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2020-12-23 17:37:24,486 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,532 INFO L625 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2020-12-23 17:37:24,533 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,534 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2020-12-23 17:37:24,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:37:24,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-12-23 17:37:24,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:37:24,880 INFO L443 ElimStorePlain]: Different costs {3=[v_prenex_2], 5=[|v_#memory_int_43|]} [2020-12-23 17:37:24,904 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,905 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2020-12-23 17:37:24,906 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,933 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,955 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2020-12-23 17:37:24,957 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:24,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:24,982 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 2 xjuncts. [2020-12-23 17:37:24,982 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:51 [2020-12-23 17:37:25,083 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:25,084 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2020-12-23 17:37:25,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:25,124 INFO L625 ElimStorePlain]: treesize reduction 32, result has 47.5 percent of original size [2020-12-23 17:37:25,128 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 17:37:25,128 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2020-12-23 17:37:25,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:37:25,190 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:25,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:25,196 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:25,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2020-12-23 17:37:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:37:25,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:37:25,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2020-12-23 17:37:25,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630130764] [2020-12-23 17:37:25,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 17:37:25,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:37:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 17:37:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-12-23 17:37:25,210 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 17 states. [2020-12-23 17:37:25,673 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2020-12-23 17:37:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:37:26,228 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2020-12-23 17:37:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 17:37:26,228 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 17:37:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:37:26,229 INFO L225 Difference]: With dead ends: 80 [2020-12-23 17:37:26,229 INFO L226 Difference]: Without dead ends: 80 [2020-12-23 17:37:26,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2020-12-23 17:37:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-23 17:37:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2020-12-23 17:37:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-23 17:37:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-12-23 17:37:26,234 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 27 [2020-12-23 17:37:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:37:26,234 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-12-23 17:37:26,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 17:37:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-12-23 17:37:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 17:37:26,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:37:26,236 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:37:26,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 17:37:26,450 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:37:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:37:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -671935741, now seen corresponding path program 1 times [2020-12-23 17:37:26,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:37:26,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003016116] [2020-12-23 17:37:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:37:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:37:26,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003016116] [2020-12-23 17:37:26,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414183795] [2020-12-23 17:37:26,568 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 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 [2020-12-23 17:37:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:26,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-23 17:37:26,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:37:26,696 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 [2020-12-23 17:37:26,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:26,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:26,709 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:26,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-12-23 17:37:26,800 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:26,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2020-12-23 17:37:26,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:37:26,804 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:26,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:26,816 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:26,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2020-12-23 17:37:26,886 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:26,886 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2020-12-23 17:37:26,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:26,932 INFO L625 ElimStorePlain]: treesize reduction 24, result has 64.2 percent of original size [2020-12-23 17:37:26,933 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:26,933 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:43 [2020-12-23 17:37:26,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:26,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:37:26,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:26,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:37:26,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:37:26,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:26,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:37:26,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 17:37:26,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:26,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:26,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:37:27,038 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:27,038 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2020-12-23 17:37:27,040 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:27,050 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:37:27,052 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:27,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:37:27,062 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:27,142 INFO L625 ElimStorePlain]: treesize reduction 12, result has 87.2 percent of original size [2020-12-23 17:37:27,144 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-12-23 17:37:27,144 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:119, output treesize:82 [2020-12-23 17:37:27,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-12-23 17:37:27,317 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:37:27,407 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:27,408 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 52 [2020-12-23 17:37:27,410 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:27,424 INFO L625 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2020-12-23 17:37:27,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:37:27,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2020-12-23 17:37:27,465 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:37:27,467 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:27,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:27,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:27,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2020-12-23 17:37:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 17:37:27,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:37:27,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2020-12-23 17:37:27,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509147792] [2020-12-23 17:37:27,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 17:37:27,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:37:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 17:37:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:37:27,506 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 19 states. [2020-12-23 17:37:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:37:28,629 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-12-23 17:37:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 17:37:28,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2020-12-23 17:37:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:37:28,630 INFO L225 Difference]: With dead ends: 61 [2020-12-23 17:37:28,630 INFO L226 Difference]: Without dead ends: 61 [2020-12-23 17:37:28,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2020-12-23 17:37:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-23 17:37:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2020-12-23 17:37:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-23 17:37:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-12-23 17:37:28,635 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 33 [2020-12-23 17:37:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:37:28,636 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-12-23 17:37:28,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 17:37:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-12-23 17:37:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 17:37:28,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:37:28,638 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:37:28,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 17:37:28,845 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:37:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:37:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1607104903, now seen corresponding path program 1 times [2020-12-23 17:37:28,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:37:28,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410504019] [2020-12-23 17:37:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:37:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 17:37:29,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410504019] [2020-12-23 17:37:29,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165563289] [2020-12-23 17:37:29,025 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 [2020-12-23 17:37:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:29,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-23 17:37:29,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:37:29,163 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 [2020-12-23 17:37:29,163 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:29,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-12-23 17:37:29,260 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:29,261 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2020-12-23 17:37:29,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:37:29,265 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:29,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2020-12-23 17:37:29,351 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:29,351 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2020-12-23 17:37:29,355 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,396 INFO L625 ElimStorePlain]: treesize reduction 24, result has 64.2 percent of original size [2020-12-23 17:37:29,397 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:43 [2020-12-23 17:37:29,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:37:29,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 17:37:29,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:29,465 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-12-23 17:37:29,465 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,476 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:37:29,478 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,514 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:29,514 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2020-12-23 17:37:29,516 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:37:29,525 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,646 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-12-23 17:37:29,647 INFO L625 ElimStorePlain]: treesize reduction 43, result has 59.4 percent of original size [2020-12-23 17:37:29,648 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 17:37:29,649 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:169, output treesize:63 [2020-12-23 17:37:29,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-12-23 17:37:29,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 17:37:29,727 INFO L443 ElimStorePlain]: Different costs {5=[|v_#memory_int_54|], 11=[v_prenex_5]} [2020-12-23 17:37:29,734 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 17:37:29,736 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,791 INFO L625 ElimStorePlain]: treesize reduction 4, result has 94.1 percent of original size [2020-12-23 17:37:29,833 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:29,834 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2020-12-23 17:37:29,836 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:29,913 INFO L625 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size [2020-12-23 17:37:29,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:29,917 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 2 xjuncts. [2020-12-23 17:37:29,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:61 [2020-12-23 17:37:29,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:30,400 WARN L197 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-23 17:37:30,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 17:37:30,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-12-23 17:37:30,502 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 17:37:30,577 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:30,577 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 52 [2020-12-23 17:37:30,580 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:30,597 INFO L625 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2020-12-23 17:37:30,599 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 17:37:30,599 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2020-12-23 17:37:30,643 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-12-23 17:37:30,644 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:30,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:30,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:30,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2020-12-23 17:37:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 17:37:30,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:37:30,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2020-12-23 17:37:30,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153255926] [2020-12-23 17:37:30,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 17:37:30,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:37:30,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 17:37:30,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-12-23 17:37:30,688 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2020-12-23 17:37:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:37:31,740 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-12-23 17:37:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 17:37:31,742 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2020-12-23 17:37:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:37:31,743 INFO L225 Difference]: With dead ends: 77 [2020-12-23 17:37:31,743 INFO L226 Difference]: Without dead ends: 77 [2020-12-23 17:37:31,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2020-12-23 17:37:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-23 17:37:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-12-23 17:37:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-23 17:37:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-23 17:37:31,748 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 43 [2020-12-23 17:37:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:37:31,748 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-23 17:37:31,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 17:37:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-23 17:37:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 17:37:31,751 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 17:37:31,751 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 17:37:31,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 17:37:31,966 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-23 17:37:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 17:37:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1808315229, now seen corresponding path program 1 times [2020-12-23 17:37:31,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 17:37:31,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515101387] [2020-12-23 17:37:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 17:37:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:32,573 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-12-23 17:37:32,757 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-12-23 17:37:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 17:37:33,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515101387] [2020-12-23 17:37:33,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584592531] [2020-12-23 17:37:33,224 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 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 [2020-12-23 17:37:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 17:37:33,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-23 17:37:33,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 17:37:33,425 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 [2020-12-23 17:37:33,426 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:33,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,455 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2020-12-23 17:37:33,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:37:33,547 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:37:33,549 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:33,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:66 [2020-12-23 17:37:33,685 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 [2020-12-23 17:37:33,686 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:33,707 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:67 [2020-12-23 17:37:33,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 17:37:33,784 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 17:37:33,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 17:37:33,798 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 17:37:33,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2020-12-23 17:37:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 17:37:34,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 17:37:34,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2020-12-23 17:37:34,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650483383] [2020-12-23 17:37:34,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 17:37:34,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 17:37:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 17:37:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2020-12-23 17:37:34,056 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 19 states. [2020-12-23 17:37:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 17:37:34,694 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2020-12-23 17:37:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 17:37:34,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2020-12-23 17:37:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 17:37:34,696 INFO L225 Difference]: With dead ends: 81 [2020-12-23 17:37:34,696 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 17:37:34,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2020-12-23 17:37:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 17:37:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 17:37:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 17:37:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 17:37:34,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-12-23 17:37:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 17:37:34,698 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 17:37:34,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 17:37:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 17:37:34,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 17:37:34,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 17:37:34,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 05:37:34 BoogieIcfgContainer [2020-12-23 17:37:34,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 17:37:34,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 17:37:34,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 17:37:34,924 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 17:37:34,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 05:36:38" (3/4) ... [2020-12-23 17:37:34,929 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 17:37:34,942 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-12-23 17:37:34,943 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-23 17:37:34,943 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-23 17:37:35,003 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/termination-crafted/4BitCounterPointer.c-witness.graphml [2020-12-23 17:37:35,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 17:37:35,005 INFO L168 Benchmark]: Toolchain (without parser) took 58240.03 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 128.3 MB in the beginning and 152.6 MB in the end (delta: -24.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,005 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 153.1 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 17:37:35,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.09 ms. Allocated memory is still 153.1 MB. Free memory was 128.1 MB in the beginning and 119.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.66 ms. Allocated memory is still 153.1 MB. Free memory was 119.1 MB in the beginning and 117.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,006 INFO L168 Benchmark]: Boogie Preprocessor took 27.66 ms. Allocated memory is still 153.1 MB. Free memory was 117.6 MB in the beginning and 116.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,007 INFO L168 Benchmark]: RCFGBuilder took 960.06 ms. Allocated memory is still 153.1 MB. Free memory was 116.5 MB in the beginning and 132.7 MB in the end (delta: -16.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,008 INFO L168 Benchmark]: TraceAbstraction took 56795.51 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 132.1 MB in the beginning and 155.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,009 INFO L168 Benchmark]: Witness Printer took 80.19 ms. Allocated memory is still 190.8 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 17:37:35,012 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 153.1 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 316.09 ms. Allocated memory is still 153.1 MB. Free memory was 128.1 MB in the beginning and 119.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 43.66 ms. Allocated memory is still 153.1 MB. Free memory was 119.1 MB in the beginning and 117.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 27.66 ms. Allocated memory is still 153.1 MB. Free memory was 117.6 MB in the beginning and 116.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 960.06 ms. Allocated memory is still 153.1 MB. Free memory was 116.5 MB in the beginning and 132.7 MB in the end (delta: -16.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 56795.51 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 132.1 MB in the beginning and 155.3 MB in the end (delta: -23.1 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. * Witness Printer took 80.19 ms. Allocated memory is still 190.8 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 31 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 56.7s, OverallIterations: 17, TraceHistogramMax: 9, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 253 SDtfs, 842 SDslu, 585 SDs, 0 SdLazy, 1990 SolverSat, 404 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 210 SyntacticMatches, 11 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 83 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 517 ConstructedInterpolants, 29 QuantifiedInterpolants, 732241 SizeOfPredicates, 99 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 236/450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...