/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-MemCleanup-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:44:14,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:44:14,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:44:14,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:44:14,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:44:14,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:44:14,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:44:14,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:44:14,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:44:14,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:44:14,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:44:14,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:44:14,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:44:14,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:44:14,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:44:14,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:44:14,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:44:14,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:44:14,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:44:14,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:44:14,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:44:14,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:44:14,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:44:14,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:44:14,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:44:14,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:44:14,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:44:14,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:44:14,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:44:14,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:44:14,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:44:14,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:44:14,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:44:14,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:44:14,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:44:14,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:44:14,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:44:15,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:44:15,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:44:15,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:44:15,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:44:15,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2020-12-23 16:44:15,049 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:44:15,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:44:15,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:44:15,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:44:15,053 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:44:15,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:44:15,054 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-23 16:44:15,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:44:15,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:44:15,054 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-23 16:44:15,055 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-23 16:44:15,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:44:15,056 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-23 16:44:15,056 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:44:15,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:44:15,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:44:15,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:44:15,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:44:15,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:44:15,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:44:15,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:44:15,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:44:15,058 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:44:15,058 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 16:44:15,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:44:15,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:44:15,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:44:15,448 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:44:15,449 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:44:15,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2020-12-23 16:44:15,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e47c361a/df78ebc35378428e85646fe0186f80e5/FLAGf212e12ab [2020-12-23 16:44:16,309 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:44:16,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2020-12-23 16:44:16,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e47c361a/df78ebc35378428e85646fe0186f80e5/FLAGf212e12ab [2020-12-23 16:44:16,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1e47c361a/df78ebc35378428e85646fe0186f80e5 [2020-12-23 16:44:16,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:44:16,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:44:16,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:44:16,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:44:16,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:44:16,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:44:16" (1/1) ... [2020-12-23 16:44:16,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599016b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:16, skipping insertion in model container [2020-12-23 16:44:16,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:44:16" (1/1) ... [2020-12-23 16:44:16,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:44:16,691 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~null~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],StructAccessExpression[IdentifierExpression[~null~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 16:44:17,049 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2020-12-23 16:44:17,055 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 16:44:17,059 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2020-12-23 16:44:17,061 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2020-12-23 16:44:17,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:44:17,080 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~null~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~null~0,],base],StructAccessExpression[IdentifierExpression[~null~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],StructAccessExpression[IdentifierExpression[~list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],StructAccessExpression[IdentifierExpression[~end~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~end~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~end~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 16:44:17,138 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2020-12-23 16:44:17,142 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] left hand side expression in assignment: lhs: VariableLHS[~end~0,] [2020-12-23 16:44:17,144 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2020-12-23 16:44:17,146 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~end~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2020-12-23 16:44:17,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:44:17,209 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:44:17,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17 WrapperNode [2020-12-23 16:44:17,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:44:17,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:44:17,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:44:17,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:44:17,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:44:17,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:44:17,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:44:17,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:44:17,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (1/1) ... [2020-12-23 16:44:17,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:44:17,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:44:17,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:44:17,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:44:17,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (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 16:44:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:44:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:44:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:44:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:44:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:44:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:44:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:44:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:44:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:44:17,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:44:18,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:44:18,125 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2020-12-23 16:44:18,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:44:18 BoogieIcfgContainer [2020-12-23 16:44:18,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:44:18,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:44:18,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:44:18,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:44:18,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:44:16" (1/3) ... [2020-12-23 16:44:18,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59097320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:44:18, skipping insertion in model container [2020-12-23 16:44:18,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:44:17" (2/3) ... [2020-12-23 16:44:18,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59097320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:44:18, skipping insertion in model container [2020-12-23 16:44:18,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:44:18" (3/3) ... [2020-12-23 16:44:18,141 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2020-12-23 16:44:18,148 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:44:18,155 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2020-12-23 16:44:18,180 INFO L253 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2020-12-23 16:44:18,217 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:44:18,218 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-23 16:44:18,218 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:44:18,218 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:44:18,218 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:44:18,218 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:44:18,219 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:44:18,219 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:44:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2020-12-23 16:44:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 16:44:18,261 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:18,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 16:44:18,263 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-12-23 16:44:18,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:18,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088465819] [2020-12-23 16:44:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:18,472 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 16:44:18,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088465819] [2020-12-23 16:44:18,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:18,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:44:18,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358471563] [2020-12-23 16:44:18,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:44:18,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:44:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:44:18,499 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2020-12-23 16:44:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:18,719 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2020-12-23 16:44:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:44:18,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 16:44:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:18,732 INFO L225 Difference]: With dead ends: 159 [2020-12-23 16:44:18,733 INFO L226 Difference]: Without dead ends: 157 [2020-12-23 16:44:18,734 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 16:44:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-23 16:44:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2020-12-23 16:44:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-23 16:44:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2020-12-23 16:44:18,782 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 3 [2020-12-23 16:44:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:18,782 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2020-12-23 16:44:18,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:44:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2020-12-23 16:44:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-23 16:44:18,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:18,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-23 16:44:18,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:44:18,784 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-12-23 16:44:18,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:18,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557933736] [2020-12-23 16:44:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:18,838 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 16:44:18,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557933736] [2020-12-23 16:44:18,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:18,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:44:18,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145617020] [2020-12-23 16:44:18,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:44:18,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:44:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:44:18,842 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 3 states. [2020-12-23 16:44:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:18,994 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2020-12-23 16:44:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:44:18,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-23 16:44:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:18,997 INFO L225 Difference]: With dead ends: 128 [2020-12-23 16:44:18,997 INFO L226 Difference]: Without dead ends: 128 [2020-12-23 16:44:18,998 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 16:44:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-23 16:44:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-12-23 16:44:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-23 16:44:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2020-12-23 16:44:19,010 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 3 [2020-12-23 16:44:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:19,010 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2020-12-23 16:44:19,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:44:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2020-12-23 16:44:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-23 16:44:19,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:19,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-23 16:44:19,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:44:19,012 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2020-12-23 16:44:19,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:19,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169307712] [2020-12-23 16:44:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:19,062 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 16:44:19,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169307712] [2020-12-23 16:44:19,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:19,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:44:19,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940786243] [2020-12-23 16:44:19,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:44:19,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:44:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:44:19,065 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 3 states. [2020-12-23 16:44:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:19,179 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-12-23 16:44:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:44:19,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-23 16:44:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:19,182 INFO L225 Difference]: With dead ends: 125 [2020-12-23 16:44:19,182 INFO L226 Difference]: Without dead ends: 125 [2020-12-23 16:44:19,182 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 16:44:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-23 16:44:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2020-12-23 16:44:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-23 16:44:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2020-12-23 16:44:19,191 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 6 [2020-12-23 16:44:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:19,192 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2020-12-23 16:44:19,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:44:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2020-12-23 16:44:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-23 16:44:19,193 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:19,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-23 16:44:19,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 16:44:19,194 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2020-12-23 16:44:19,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:19,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858940882] [2020-12-23 16:44:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:19,272 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 16:44:19,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858940882] [2020-12-23 16:44:19,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:19,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:44:19,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906955544] [2020-12-23 16:44:19,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:44:19,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:44:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:44:19,279 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 3 states. [2020-12-23 16:44:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:19,412 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2020-12-23 16:44:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:44:19,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-23 16:44:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:19,414 INFO L225 Difference]: With dead ends: 141 [2020-12-23 16:44:19,414 INFO L226 Difference]: Without dead ends: 141 [2020-12-23 16:44:19,415 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 16:44:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-12-23 16:44:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2020-12-23 16:44:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-23 16:44:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2020-12-23 16:44:19,422 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 6 [2020-12-23 16:44:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:19,423 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2020-12-23 16:44:19,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:44:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2020-12-23 16:44:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 16:44:19,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:19,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:19,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 16:44:19,424 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 171980525, now seen corresponding path program 1 times [2020-12-23 16:44:19,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:19,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267026643] [2020-12-23 16:44:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:19,547 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 16:44:19,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267026643] [2020-12-23 16:44:19,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:19,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:44:19,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198123385] [2020-12-23 16:44:19,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:44:19,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:44:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:44:19,554 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2020-12-23 16:44:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:19,716 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2020-12-23 16:44:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:44:19,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-23 16:44:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:19,717 INFO L225 Difference]: With dead ends: 132 [2020-12-23 16:44:19,717 INFO L226 Difference]: Without dead ends: 132 [2020-12-23 16:44:19,718 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 16:44:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-23 16:44:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2020-12-23 16:44:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-23 16:44:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2020-12-23 16:44:19,734 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 11 [2020-12-23 16:44:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:19,734 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2020-12-23 16:44:19,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:44:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2020-12-23 16:44:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 16:44:19,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:19,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:19,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 16:44:19,737 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:19,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash 171980526, now seen corresponding path program 1 times [2020-12-23 16:44:19,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:19,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867160431] [2020-12-23 16:44:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:19,861 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 16:44:19,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867160431] [2020-12-23 16:44:19,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:19,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:44:19,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721757531] [2020-12-23 16:44:19,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:44:19,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:19,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:44:19,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:44:19,865 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 4 states. [2020-12-23 16:44:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:20,068 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2020-12-23 16:44:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:44:20,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-23 16:44:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:20,069 INFO L225 Difference]: With dead ends: 155 [2020-12-23 16:44:20,070 INFO L226 Difference]: Without dead ends: 155 [2020-12-23 16:44:20,070 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 16:44:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-23 16:44:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2020-12-23 16:44:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 16:44:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2020-12-23 16:44:20,080 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 11 [2020-12-23 16:44:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:20,084 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2020-12-23 16:44:20,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:44:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2020-12-23 16:44:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 16:44:20,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:20,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:20,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 16:44:20,092 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2064507511, now seen corresponding path program 1 times [2020-12-23 16:44:20,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:20,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195179544] [2020-12-23 16:44:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:20,176 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 16:44:20,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195179544] [2020-12-23 16:44:20,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:20,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:44:20,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246056740] [2020-12-23 16:44:20,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:44:20,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:44:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:44:20,179 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 5 states. [2020-12-23 16:44:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:20,371 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2020-12-23 16:44:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:44:20,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-23 16:44:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:20,374 INFO L225 Difference]: With dead ends: 164 [2020-12-23 16:44:20,375 INFO L226 Difference]: Without dead ends: 164 [2020-12-23 16:44:20,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:44:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-23 16:44:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2020-12-23 16:44:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-23 16:44:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2020-12-23 16:44:20,379 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 13 [2020-12-23 16:44:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:20,380 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2020-12-23 16:44:20,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:44:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2020-12-23 16:44:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 16:44:20,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:20,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:20,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 16:44:20,381 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash -424163756, now seen corresponding path program 1 times [2020-12-23 16:44:20,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:20,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487096330] [2020-12-23 16:44:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:20,438 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 16:44:20,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487096330] [2020-12-23 16:44:20,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:20,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:44:20,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23068634] [2020-12-23 16:44:20,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:44:20,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:44:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:44:20,440 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 6 states. [2020-12-23 16:44:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:20,702 INFO L93 Difference]: Finished difference Result 175 states and 190 transitions. [2020-12-23 16:44:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:44:20,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-23 16:44:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:20,704 INFO L225 Difference]: With dead ends: 175 [2020-12-23 16:44:20,704 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 16:44:20,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 16:44:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2020-12-23 16:44:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 16:44:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2020-12-23 16:44:20,714 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 14 [2020-12-23 16:44:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:20,715 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2020-12-23 16:44:20,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:44:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2020-12-23 16:44:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 16:44:20,716 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:20,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:20,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 16:44:20,718 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash -424163755, now seen corresponding path program 1 times [2020-12-23 16:44:20,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:20,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734362993] [2020-12-23 16:44:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:20,830 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 16:44:20,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734362993] [2020-12-23 16:44:20,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:20,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:44:20,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646094709] [2020-12-23 16:44:20,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:44:20,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:44:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:44:20,837 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 6 states. [2020-12-23 16:44:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:21,176 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2020-12-23 16:44:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:44:21,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-23 16:44:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:21,177 INFO L225 Difference]: With dead ends: 213 [2020-12-23 16:44:21,178 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 16:44:21,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:44:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 16:44:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 120. [2020-12-23 16:44:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-23 16:44:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2020-12-23 16:44:21,182 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 14 [2020-12-23 16:44:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:21,182 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2020-12-23 16:44:21,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:44:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2020-12-23 16:44:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 16:44:21,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:21,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:21,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 16:44:21,184 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash -184428353, now seen corresponding path program 1 times [2020-12-23 16:44:21,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:21,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760486573] [2020-12-23 16:44:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:21,353 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 16:44:21,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760486573] [2020-12-23 16:44:21,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:21,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 16:44:21,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980668352] [2020-12-23 16:44:21,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 16:44:21,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 16:44:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:44:21,357 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 8 states. [2020-12-23 16:44:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:21,616 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2020-12-23 16:44:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:44:21,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-23 16:44:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:21,618 INFO L225 Difference]: With dead ends: 180 [2020-12-23 16:44:21,618 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 16:44:21,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:44:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 16:44:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 127. [2020-12-23 16:44:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-23 16:44:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2020-12-23 16:44:21,622 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 16 [2020-12-23 16:44:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:21,623 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2020-12-23 16:44:21,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 16:44:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2020-12-23 16:44:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 16:44:21,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:21,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:21,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 16:44:21,625 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash -519135549, now seen corresponding path program 1 times [2020-12-23 16:44:21,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:21,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827655752] [2020-12-23 16:44:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:21,672 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 16:44:21,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827655752] [2020-12-23 16:44:21,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:21,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:44:21,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035831024] [2020-12-23 16:44:21,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:44:21,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:44:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:44:21,677 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand 6 states. [2020-12-23 16:44:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:21,950 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2020-12-23 16:44:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:44:21,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-23 16:44:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:21,952 INFO L225 Difference]: With dead ends: 188 [2020-12-23 16:44:21,952 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 16:44:21,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 16:44:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 126. [2020-12-23 16:44:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-23 16:44:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2020-12-23 16:44:21,956 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 22 [2020-12-23 16:44:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:21,957 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2020-12-23 16:44:21,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:44:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2020-12-23 16:44:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 16:44:21,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:21,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:21,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 16:44:21,959 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash -519135548, now seen corresponding path program 1 times [2020-12-23 16:44:21,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:21,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520090202] [2020-12-23 16:44:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:22,019 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 16:44:22,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520090202] [2020-12-23 16:44:22,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:22,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:44:22,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107237341] [2020-12-23 16:44:22,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:44:22,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:44:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:44:22,022 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 6 states. [2020-12-23 16:44:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:22,368 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2020-12-23 16:44:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:44:22,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-23 16:44:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:22,370 INFO L225 Difference]: With dead ends: 222 [2020-12-23 16:44:22,371 INFO L226 Difference]: Without dead ends: 222 [2020-12-23 16:44:22,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-12-23 16:44:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 118. [2020-12-23 16:44:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-23 16:44:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2020-12-23 16:44:22,376 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 22 [2020-12-23 16:44:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:22,376 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2020-12-23 16:44:22,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:44:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2020-12-23 16:44:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 16:44:22,377 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:22,377 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, 1] [2020-12-23 16:44:22,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 16:44:22,378 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1684321317, now seen corresponding path program 1 times [2020-12-23 16:44:22,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:22,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489547768] [2020-12-23 16:44:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:22,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489547768] [2020-12-23 16:44:22,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561861492] [2020-12-23 16:44:22,442 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 16:44:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:22,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 16:44:22,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:22,585 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 16:44:22,586 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:22,599 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 16:44:22,600 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:22,604 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,604 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-12-23 16:44:22,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:22,627 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 27 treesize of output 11 [2020-12-23 16:44:22,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:22,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:22,642 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 27 treesize of output 11 [2020-12-23 16:44:22,644 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:22,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,650 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2020-12-23 16:44:22,696 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 16:44:22,698 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:22,705 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 16:44:22,706 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:22,711 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:22,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-12-23 16:44:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:22,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:22,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-12-23 16:44:22,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497360337] [2020-12-23 16:44:22,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:44:22,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:44:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:44:22,723 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 6 states. [2020-12-23 16:44:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:22,969 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2020-12-23 16:44:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:44:22,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-23 16:44:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:22,971 INFO L225 Difference]: With dead ends: 169 [2020-12-23 16:44:22,971 INFO L226 Difference]: Without dead ends: 169 [2020-12-23 16:44:22,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-12-23 16:44:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2020-12-23 16:44:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 16:44:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2020-12-23 16:44:22,976 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 23 [2020-12-23 16:44:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:22,976 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2020-12-23 16:44:22,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:44:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2020-12-23 16:44:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 16:44:22,977 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:22,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:23,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:44:23,194 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1642303064, now seen corresponding path program 1 times [2020-12-23 16:44:23,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:23,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965116359] [2020-12-23 16:44:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:23,323 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 16:44:23,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965116359] [2020-12-23 16:44:23,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:23,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:44:23,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095241064] [2020-12-23 16:44:23,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:44:23,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:44:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:44:23,327 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 5 states. [2020-12-23 16:44:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:23,439 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2020-12-23 16:44:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:44:23,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-23 16:44:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:23,441 INFO L225 Difference]: With dead ends: 128 [2020-12-23 16:44:23,441 INFO L226 Difference]: Without dead ends: 128 [2020-12-23 16:44:23,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:44:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-23 16:44:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2020-12-23 16:44:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-12-23 16:44:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2020-12-23 16:44:23,445 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 23 [2020-12-23 16:44:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:23,445 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2020-12-23 16:44:23,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:44:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2020-12-23 16:44:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 16:44:23,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:23,448 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, 1, 1, 1] [2020-12-23 16:44:23,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 16:44:23,449 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -693335672, now seen corresponding path program 1 times [2020-12-23 16:44:23,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:23,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335896417] [2020-12-23 16:44:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:23,914 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 16:44:23,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335896417] [2020-12-23 16:44:23,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423989177] [2020-12-23 16:44:23,914 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 16:44:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:24,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 16:44:24,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:24,043 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:44:24,043 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,045 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 16:44:24,061 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 16:44:24,062 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,066 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,066 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 16:44:24,110 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,111 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:44:24,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:24,122 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,129 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,130 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 16:44:24,157 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_29|]} [2020-12-23 16:44:24,161 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 16:44:24,162 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:24,177 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:44:24,178 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,187 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,188 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:24 [2020-12-23 16:44:24,239 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 16 treesize of output 8 [2020-12-23 16:44:24,240 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,247 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 16:44:24,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2020-12-23 16:44:24,300 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 25 treesize of output 13 [2020-12-23 16:44:24,302 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,307 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-12-23 16:44:24,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 16:44:24,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,337 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 16:44:24,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-12-23 16:44:24,475 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 28 treesize of output 10 [2020-12-23 16:44:24,477 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:24,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:24,482 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 16:44:24,482 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-12-23 16:44:24,488 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 16:44:24,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:24,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2020-12-23 16:44:24,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073007408] [2020-12-23 16:44:24,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-23 16:44:24,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-23 16:44:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2020-12-23 16:44:24,490 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 25 states. [2020-12-23 16:44:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:26,248 INFO L93 Difference]: Finished difference Result 215 states and 231 transitions. [2020-12-23 16:44:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 16:44:26,249 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2020-12-23 16:44:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:26,251 INFO L225 Difference]: With dead ends: 215 [2020-12-23 16:44:26,251 INFO L226 Difference]: Without dead ends: 215 [2020-12-23 16:44:26,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2020-12-23 16:44:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-23 16:44:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2020-12-23 16:44:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-12-23 16:44:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2020-12-23 16:44:26,260 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 25 [2020-12-23 16:44:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:26,261 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2020-12-23 16:44:26,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-23 16:44:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-12-23 16:44:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 16:44:26,262 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:26,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:26,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 16:44:26,478 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:26,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1211141808, now seen corresponding path program 1 times [2020-12-23 16:44:26,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:26,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282849801] [2020-12-23 16:44:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:26,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282849801] [2020-12-23 16:44:26,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116607858] [2020-12-23 16:44:26,563 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 16:44:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:26,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:44:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:44:26,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:44:26,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2020-12-23 16:44:26,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724683433] [2020-12-23 16:44:26,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:44:26,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:44:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:26,657 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 3 states. [2020-12-23 16:44:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:26,695 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2020-12-23 16:44:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:44:26,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-23 16:44:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:26,696 INFO L225 Difference]: With dead ends: 139 [2020-12-23 16:44:26,696 INFO L226 Difference]: Without dead ends: 139 [2020-12-23 16:44:26,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-23 16:44:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-12-23 16:44:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-12-23 16:44:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2020-12-23 16:44:26,700 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 29 [2020-12-23 16:44:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:26,700 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2020-12-23 16:44:26,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:44:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2020-12-23 16:44:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 16:44:26,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:26,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:26,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 16:44:26,916 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28866931, now seen corresponding path program 1 times [2020-12-23 16:44:26,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:26,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124867244] [2020-12-23 16:44:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:27,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124867244] [2020-12-23 16:44:27,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093087552] [2020-12-23 16:44:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:44:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:27,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:44:27,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:27,095 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 16:44:27,096 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:27,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:27,098 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:27,098 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-12-23 16:44:27,118 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-23 16:44:27,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:27,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:27,121 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 16:44:27,122 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-12-23 16:44:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:44:27,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:44:27,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2020-12-23 16:44:27,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534429028] [2020-12-23 16:44:27,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:44:27,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:44:27,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:27,137 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 4 states. [2020-12-23 16:44:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:27,213 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2020-12-23 16:44:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:44:27,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-23 16:44:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:27,214 INFO L225 Difference]: With dead ends: 147 [2020-12-23 16:44:27,215 INFO L226 Difference]: Without dead ends: 147 [2020-12-23 16:44:27,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-23 16:44:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-23 16:44:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2020-12-23 16:44:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-23 16:44:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-12-23 16:44:27,219 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 31 [2020-12-23 16:44:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:27,219 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-12-23 16:44:27,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:44:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-12-23 16:44:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 16:44:27,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:27,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:27,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:44:27,435 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1812265073, now seen corresponding path program 1 times [2020-12-23 16:44:27,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:27,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647292372] [2020-12-23 16:44:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:28,114 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 16:44:28,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647292372] [2020-12-23 16:44:28,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600305130] [2020-12-23 16:44:28,114 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 16:44:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:28,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 16:44:28,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:28,218 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 16:44:28,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,223 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,223 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 16:44:28,267 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,267 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:44:28,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:28,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:28,276 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,283 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 16:44:28,313 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_33|], 2=[|v_#memory_int_34|]} [2020-12-23 16:44:28,317 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 16:44:28,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:28,340 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:44:28,341 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,352 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2020-12-23 16:44:28,387 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 16 treesize of output 8 [2020-12-23 16:44:28,388 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,399 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 16:44:28,400 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:19 [2020-12-23 16:44:28,451 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 25 treesize of output 13 [2020-12-23 16:44:28,452 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2020-12-23 16:44:28,469 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 16:44:28,470 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,478 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-12-23 16:44:28,510 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,510 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:44:28,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:28,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:28,515 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,523 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,523 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2020-12-23 16:44:28,553 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|], 6=[|v_#memory_int_37|]} [2020-12-23 16:44:28,558 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 16:44:28,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:28,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 16:44:28,597 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,609 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,612 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2020-12-23 16:44:28,657 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2020-12-23 16:44:28,658 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,670 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 16:44:28,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2020-12-23 16:44:28,776 INFO L348 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-12-23 16:44:28,777 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 34 treesize of output 35 [2020-12-23 16:44:28,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:28,797 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 16:44:28,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2020-12-23 16:44:28,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:28,857 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 16:44:28,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:28,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:28,871 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 16:44:28,871 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-12-23 16:44:29,000 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 28 treesize of output 10 [2020-12-23 16:44:29,001 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:29,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:29,010 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 16:44:29,011 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-12-23 16:44:29,019 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 16:44:29,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:29,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2020-12-23 16:44:29,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100218259] [2020-12-23 16:44:29,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-23 16:44:29,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:29,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-23 16:44:29,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 16:44:29,022 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 35 states. [2020-12-23 16:44:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:31,664 INFO L93 Difference]: Finished difference Result 215 states and 230 transitions. [2020-12-23 16:44:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 16:44:31,664 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2020-12-23 16:44:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:31,666 INFO L225 Difference]: With dead ends: 215 [2020-12-23 16:44:31,666 INFO L226 Difference]: Without dead ends: 215 [2020-12-23 16:44:31,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=588, Invalid=2492, Unknown=0, NotChecked=0, Total=3080 [2020-12-23 16:44:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-23 16:44:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 149. [2020-12-23 16:44:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 16:44:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2020-12-23 16:44:31,673 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 31 [2020-12-23 16:44:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:31,673 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2020-12-23 16:44:31,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-23 16:44:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2020-12-23 16:44:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 16:44:31,674 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:31,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:31,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 16:44:31,888 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -716923980, now seen corresponding path program 1 times [2020-12-23 16:44:31,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:31,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145582552] [2020-12-23 16:44:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:32,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145582552] [2020-12-23 16:44:32,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775995388] [2020-12-23 16:44:32,044 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 16:44:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:32,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 16:44:32,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:32,117 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 16:44:32,119 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:32,126 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 16:44:32,131 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:32,135 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-12-23 16:44:32,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:32,150 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 27 treesize of output 11 [2020-12-23 16:44:32,153 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:32,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:32,168 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 27 treesize of output 11 [2020-12-23 16:44:32,169 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:32,173 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,173 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2020-12-23 16:44:32,197 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 16:44:32,199 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:32,207 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 16:44:32,208 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:32,211 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:32,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2020-12-23 16:44:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:44:32,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:32,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2020-12-23 16:44:32,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069574962] [2020-12-23 16:44:32,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 16:44:32,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 16:44:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:44:32,225 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 9 states. [2020-12-23 16:44:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:32,795 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2020-12-23 16:44:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 16:44:32,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-12-23 16:44:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:32,797 INFO L225 Difference]: With dead ends: 203 [2020-12-23 16:44:32,797 INFO L226 Difference]: Without dead ends: 203 [2020-12-23 16:44:32,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-12-23 16:44:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-23 16:44:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 160. [2020-12-23 16:44:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-12-23 16:44:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2020-12-23 16:44:32,802 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 32 [2020-12-23 16:44:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:32,802 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2020-12-23 16:44:32,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 16:44:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2020-12-23 16:44:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 16:44:32,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:32,803 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:33,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:44:33,017 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1910489284, now seen corresponding path program 1 times [2020-12-23 16:44:33,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:33,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309757090] [2020-12-23 16:44:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:33,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309757090] [2020-12-23 16:44:33,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925906739] [2020-12-23 16:44:33,162 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 16:44:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:33,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 16:44:33,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:33,262 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:44:33,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,266 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,266 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 16:44:33,320 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2020-12-23 16:44:33,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:33,326 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-12-23 16:44:33,374 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 16:44:33,375 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,387 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 16:44:33,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2020-12-23 16:44:33,503 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,504 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 36 treesize of output 51 [2020-12-23 16:44:33,506 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,517 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 16:44:33,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:25 [2020-12-23 16:44:33,575 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,575 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2020-12-23 16:44:33,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 16:44:33,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:44:33,580 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,592 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 16:44:33,592 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:26 [2020-12-23 16:44:33,664 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:44:33,666 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:33,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:33,671 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 16:44:33,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2020-12-23 16:44:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:33,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:33,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-12-23 16:44:33,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882878346] [2020-12-23 16:44:33,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-23 16:44:33,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-23 16:44:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2020-12-23 16:44:33,769 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 24 states. [2020-12-23 16:44:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:34,864 INFO L93 Difference]: Finished difference Result 249 states and 270 transitions. [2020-12-23 16:44:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 16:44:34,865 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2020-12-23 16:44:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:34,866 INFO L225 Difference]: With dead ends: 249 [2020-12-23 16:44:34,867 INFO L226 Difference]: Without dead ends: 249 [2020-12-23 16:44:34,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2020-12-23 16:44:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-12-23 16:44:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 175. [2020-12-23 16:44:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-23 16:44:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2020-12-23 16:44:34,873 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 32 [2020-12-23 16:44:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:34,873 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2020-12-23 16:44:34,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-23 16:44:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2020-12-23 16:44:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 16:44:34,874 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:34,874 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:35,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:44:35,088 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1910489283, now seen corresponding path program 1 times [2020-12-23 16:44:35,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:35,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069639828] [2020-12-23 16:44:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:35,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069639828] [2020-12-23 16:44:35,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955731304] [2020-12-23 16:44:35,295 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 16:44:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 50 conjunts are in the unsatisfiable core [2020-12-23 16:44:35,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:35,392 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:44:35,393 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,399 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:44:35,401 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,407 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2020-12-23 16:44:35,466 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,466 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:44:35,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:35,469 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,484 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2020-12-23 16:44:35,486 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,498 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,498 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2020-12-23 16:44:35,546 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 16:44:35,546 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,565 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 16:44:35,566 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2020-12-23 16:44:35,713 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,714 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 36 treesize of output 51 [2020-12-23 16:44:35,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,739 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 26 treesize of output 21 [2020-12-23 16:44:35,740 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,759 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,759 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:42 [2020-12-23 16:44:35,817 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_42|], 6=[|v_#memory_$Pointer$.offset_36|]} [2020-12-23 16:44:35,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:35,822 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 68 [2020-12-23 16:44:35,823 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:35,849 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 0 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 16:44:35,850 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:35,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:35,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:44:35,865 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:58 [2020-12-23 16:44:36,048 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2020-12-23 16:44:36,055 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 47 treesize of output 27 [2020-12-23 16:44:36,057 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:36,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:36,070 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 16:44:36,072 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:36,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:36,084 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:44:36,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:23 [2020-12-23 16:44:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:36,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:36,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2020-12-23 16:44:36,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616760761] [2020-12-23 16:44:36,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-23 16:44:36,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-23 16:44:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2020-12-23 16:44:36,183 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand 24 states. [2020-12-23 16:44:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:37,826 INFO L93 Difference]: Finished difference Result 234 states and 254 transitions. [2020-12-23 16:44:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 16:44:37,826 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2020-12-23 16:44:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:37,828 INFO L225 Difference]: With dead ends: 234 [2020-12-23 16:44:37,828 INFO L226 Difference]: Without dead ends: 234 [2020-12-23 16:44:37,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2020-12-23 16:44:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-12-23 16:44:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2020-12-23 16:44:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-12-23 16:44:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2020-12-23 16:44:37,833 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 32 [2020-12-23 16:44:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:37,833 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2020-12-23 16:44:37,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-23 16:44:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2020-12-23 16:44:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 16:44:37,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:37,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:44:38,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 16:44:38,048 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash -749807296, now seen corresponding path program 1 times [2020-12-23 16:44:38,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:38,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213589068] [2020-12-23 16:44:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:44:38,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213589068] [2020-12-23 16:44:38,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:44:38,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:44:38,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789741836] [2020-12-23 16:44:38,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:44:38,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:38,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:44:38,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:44:38,104 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand 3 states. [2020-12-23 16:44:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:44:38,133 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-12-23 16:44:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:44:38,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-23 16:44:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:44:38,134 INFO L225 Difference]: With dead ends: 177 [2020-12-23 16:44:38,135 INFO L226 Difference]: Without dead ends: 177 [2020-12-23 16:44:38,135 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 16:44:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-23 16:44:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-12-23 16:44:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-12-23 16:44:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2020-12-23 16:44:38,139 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 33 [2020-12-23 16:44:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:44:38,139 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2020-12-23 16:44:38,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:44:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-12-23 16:44:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-23 16:44:38,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:44:38,140 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, 1] [2020-12-23 16:44:38,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 16:44:38,141 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:44:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:44:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2142350047, now seen corresponding path program 2 times [2020-12-23 16:44:38,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:44:38,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180860570] [2020-12-23 16:44:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:44:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:44:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:38,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180860570] [2020-12-23 16:44:38,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494380295] [2020-12-23 16:44:38,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:44:38,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:44:38,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:44:38,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-23 16:44:38,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:44:38,787 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:44:38,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:38,789 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 16:44:38,802 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 16:44:38,803 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:38,807 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,807 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 16:44:38,861 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:38,861 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2020-12-23 16:44:38,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:38,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:38,875 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,875 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2020-12-23 16:44:38,905 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_43|], 2=[|v_#memory_int_41|]} [2020-12-23 16:44:38,911 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 16:44:38,912 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:38,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:38,934 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:44:38,936 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,947 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:38,948 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:38,948 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2020-12-23 16:44:38,992 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:44:38,993 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,003 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 16:44:39,003 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2020-12-23 16:44:39,056 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 25 treesize of output 13 [2020-12-23 16:44:39,057 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,064 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,064 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2020-12-23 16:44:39,078 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 16:44:39,079 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,088 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-12-23 16:44:39,130 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,131 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 16:44:39,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:44:39,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:44:39,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,142 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,143 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,143 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2020-12-23 16:44:39,172 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_44|], 6=[|v_#memory_int_44|]} [2020-12-23 16:44:39,176 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 16:44:39,177 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:44:39,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 16:44:39,193 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,204 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,204 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:39 [2020-12-23 16:44:39,248 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-12-23 16:44:39,249 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,259 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 16:44:39,259 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2020-12-23 16:44:39,352 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 16:44:39,353 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,362 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 16:44:39,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2020-12-23 16:44:39,432 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 16:44:39,433 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,445 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 16:44:39,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-12-23 16:44:39,662 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 37 treesize of output 13 [2020-12-23 16:44:39,664 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,669 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:44:39,671 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:44:39,671 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-12-23 16:44:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:44:39,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:44:39,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2020-12-23 16:44:39,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411639664] [2020-12-23 16:44:39,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-23 16:44:39,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:44:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-23 16:44:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 16:44:39,684 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand 34 states. [2020-12-23 16:44:57,938 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-12-23 16:45:04,155 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-12-23 16:45:08,409 WARN L197 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-12-23 16:45:10,578 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-12-23 16:45:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:45:13,857 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2020-12-23 16:45:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-23 16:45:13,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2020-12-23 16:45:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:45:13,860 INFO L225 Difference]: With dead ends: 302 [2020-12-23 16:45:13,860 INFO L226 Difference]: Without dead ends: 302 [2020-12-23 16:45:13,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=753, Invalid=2907, Unknown=0, NotChecked=0, Total=3660 [2020-12-23 16:45:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-23 16:45:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 186. [2020-12-23 16:45:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-23 16:45:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2020-12-23 16:45:13,866 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 34 [2020-12-23 16:45:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:45:13,867 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2020-12-23 16:45:13,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-23 16:45:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2020-12-23 16:45:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 16:45:13,867 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:45:13,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:45:14,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:14,077 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:45:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:45:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 989702499, now seen corresponding path program 1 times [2020-12-23 16:45:14,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:45:14,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686413606] [2020-12-23 16:45:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:45:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:45:14,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686413606] [2020-12-23 16:45:14,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767208116] [2020-12-23 16:45:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:14,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 16:45:14,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:45:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:45:14,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:45:14,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-12-23 16:45:14,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857892788] [2020-12-23 16:45:14,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 16:45:14,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:45:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 16:45:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-12-23 16:45:14,569 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 15 states. [2020-12-23 16:45:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:45:15,036 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2020-12-23 16:45:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 16:45:15,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2020-12-23 16:45:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:45:15,038 INFO L225 Difference]: With dead ends: 196 [2020-12-23 16:45:15,038 INFO L226 Difference]: Without dead ends: 171 [2020-12-23 16:45:15,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-12-23 16:45:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-23 16:45:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-12-23 16:45:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-12-23 16:45:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2020-12-23 16:45:15,044 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 35 [2020-12-23 16:45:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:45:15,044 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2020-12-23 16:45:15,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 16:45:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2020-12-23 16:45:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 16:45:15,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:45:15,045 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:45:15,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:15,256 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:45:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:45:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash 891521741, now seen corresponding path program 2 times [2020-12-23 16:45:15,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:45:15,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272514244] [2020-12-23 16:45:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:45:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:15,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272514244] [2020-12-23 16:45:15,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895587269] [2020-12-23 16:45:15,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:15,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:45:15,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:45:15,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 56 conjunts are in the unsatisfiable core [2020-12-23 16:45:15,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:45:15,599 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2020-12-23 16:45:15,600 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:15,606 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,606 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2020-12-23 16:45:15,724 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_87|]} [2020-12-23 16:45:15,728 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:45:15,728 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:15,750 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:15,750 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:45:15,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:15,753 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:15,766 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,766 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2020-12-23 16:45:15,818 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 16:45:15,818 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:15,839 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 16:45:15,840 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:15,861 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:15,861 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2020-12-23 16:45:16,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:16,011 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 16:45:16,012 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,037 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,056 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,056 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 36 treesize of output 51 [2020-12-23 16:45:16,061 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,087 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,087 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:53 [2020-12-23 16:45:16,161 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,161 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 126 [2020-12-23 16:45:16,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:16,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:16,200 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,201 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 84 [2020-12-23 16:45:16,204 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,221 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,222 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:67 [2020-12-23 16:45:16,502 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-12-23 16:45:16,503 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,526 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:16,526 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:75 [2020-12-23 16:45:16,615 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:45:16,618 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,618 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 44 [2020-12-23 16:45:16,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:45:16,622 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:16,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,644 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 16 [2020-12-23 16:45:16,645 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:16,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:16,658 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:13 [2020-12-23 16:45:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:16,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:45:16,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2020-12-23 16:45:16,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84498478] [2020-12-23 16:45:16,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 16:45:16,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:45:16,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 16:45:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2020-12-23 16:45:16,750 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 32 states. [2020-12-23 16:45:24,373 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2020-12-23 16:45:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:45:25,973 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2020-12-23 16:45:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 16:45:25,973 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2020-12-23 16:45:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:45:25,975 INFO L225 Difference]: With dead ends: 226 [2020-12-23 16:45:25,975 INFO L226 Difference]: Without dead ends: 226 [2020-12-23 16:45:25,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=378, Invalid=1974, Unknown=0, NotChecked=0, Total=2352 [2020-12-23 16:45:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-12-23 16:45:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 173. [2020-12-23 16:45:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-12-23 16:45:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2020-12-23 16:45:25,980 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 37 [2020-12-23 16:45:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:45:25,981 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2020-12-23 16:45:25,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 16:45:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2020-12-23 16:45:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 16:45:25,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:45:25,982 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:45:26,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 16:45:26,195 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:45:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:45:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash 849503488, now seen corresponding path program 1 times [2020-12-23 16:45:26,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:45:26,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185331054] [2020-12-23 16:45:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:45:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:26,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185331054] [2020-12-23 16:45:26,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911469583] [2020-12-23 16:45:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:26,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 53 conjunts are in the unsatisfiable core [2020-12-23 16:45:26,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:45:26,682 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:45:26,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,690 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,694 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:45:26,694 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,702 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,702 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2020-12-23 16:45:26,792 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,793 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:45:26,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:26,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,812 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2020-12-23 16:45:26,813 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,835 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,835 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2020-12-23 16:45:26,883 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 16:45:26,884 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,903 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 16:45:26,904 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:26,921 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:26,921 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2020-12-23 16:45:27,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:27,061 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 16:45:27,062 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,098 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,098 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 36 treesize of output 51 [2020-12-23 16:45:27,100 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,117 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,118 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:42 [2020-12-23 16:45:27,171 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 12 [2020-12-23 16:45:27,172 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,197 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 2=[|v_#memory_$Pointer$.base_50|], 6=[|v_#memory_$Pointer$.offset_42|]} [2020-12-23 16:45:27,202 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 21 treesize of output 13 [2020-12-23 16:45:27,203 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:27,231 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 65 [2020-12-23 16:45:27,232 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:27,253 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 0 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 16:45:27,255 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,270 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:27,270 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:141, output treesize:49 [2020-12-23 16:45:27,410 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2020-12-23 16:45:27,413 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 40 treesize of output 24 [2020-12-23 16:45:27,414 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,428 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 16:45:27,429 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,438 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:27,438 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:19 [2020-12-23 16:45:27,539 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:45:27,541 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,541 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2020-12-23 16:45:27,542 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:27,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:27,548 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 16:45:27,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2020-12-23 16:45:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:27,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:45:27,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2020-12-23 16:45:27,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947113440] [2020-12-23 16:45:27,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 16:45:27,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:45:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 16:45:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2020-12-23 16:45:27,591 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand 30 states. [2020-12-23 16:45:29,470 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2020-12-23 16:45:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:45:30,722 INFO L93 Difference]: Finished difference Result 204 states and 221 transitions. [2020-12-23 16:45:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 16:45:30,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2020-12-23 16:45:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:45:30,723 INFO L225 Difference]: With dead ends: 204 [2020-12-23 16:45:30,723 INFO L226 Difference]: Without dead ends: 204 [2020-12-23 16:45:30,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2020-12-23 16:45:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-23 16:45:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 172. [2020-12-23 16:45:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-12-23 16:45:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2020-12-23 16:45:30,729 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 37 [2020-12-23 16:45:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:45:30,729 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2020-12-23 16:45:30,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 16:45:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2020-12-23 16:45:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 16:45:30,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:45:30,730 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:45:30,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 16:45:30,935 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:45:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:45:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2008007851, now seen corresponding path program 1 times [2020-12-23 16:45:30,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:45:30,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66391804] [2020-12-23 16:45:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:45:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:31,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66391804] [2020-12-23 16:45:31,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119636383] [2020-12-23 16:45:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:31,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 51 conjunts are in the unsatisfiable core [2020-12-23 16:45:31,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:45:31,327 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:45:31,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,337 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-12-23 16:45:31,371 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 16:45:31,371 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,389 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 16:45:31,389 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,402 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,402 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2020-12-23 16:45:31,440 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 16:45:31,440 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,450 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,452 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2020-12-23 16:45:31,541 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,541 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 28 treesize of output 39 [2020-12-23 16:45:31,543 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,571 INFO L625 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2020-12-23 16:45:31,572 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,573 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2020-12-23 16:45:31,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:31,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:31,640 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 27 treesize of output 11 [2020-12-23 16:45:31,640 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:31,651 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,651 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 1 case distinctions, treesize of input 34 treesize of output 29 [2020-12-23 16:45:31,652 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,709 INFO L625 ElimStorePlain]: treesize reduction 13, result has 80.6 percent of original size [2020-12-23 16:45:31,710 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:31,711 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:54 [2020-12-23 16:45:31,830 INFO L348 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2020-12-23 16:45:31,831 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 69 [2020-12-23 16:45:31,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:31,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:31,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:31,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:31,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:31,845 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,868 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:31,869 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2020-12-23 16:45:31,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:31,872 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:31,936 INFO L625 ElimStorePlain]: treesize reduction 10, result has 88.4 percent of original size [2020-12-23 16:45:31,938 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:31,938 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:76 [2020-12-23 16:45:32,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:32,026 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 11 [2020-12-23 16:45:32,028 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,048 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,049 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 2 case distinctions, treesize of input 26 treesize of output 45 [2020-12-23 16:45:32,050 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,122 INFO L625 ElimStorePlain]: treesize reduction 24, result has 76.0 percent of original size [2020-12-23 16:45:32,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:32,124 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:82 [2020-12-23 16:45:32,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2020-12-23 16:45:32,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:32,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:32,346 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,347 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 36 treesize of output 51 [2020-12-23 16:45:32,348 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,386 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,386 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 102 [2020-12-23 16:45:32,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:32,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:32,390 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:32,396 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,454 INFO L625 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2020-12-23 16:45:32,455 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:32,455 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:72 [2020-12-23 16:45:32,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-12-23 16:45:32,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:32,514 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_56|], 6=[v_prenex_1]} [2020-12-23 16:45:32,532 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,532 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2020-12-23 16:45:32,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 16:45:32,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:45:32,535 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,604 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,605 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 130 [2020-12-23 16:45:32,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 16:45:32,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:32,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:32,621 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,659 INFO L625 ElimStorePlain]: treesize reduction 20, result has 78.7 percent of original size [2020-12-23 16:45:32,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:32,660 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:74 [2020-12-23 16:45:32,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-23 16:45:32,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:32,816 INFO L443 ElimStorePlain]: Different costs {0=[v_prenex_4], 1=[|#memory_$Pointer$.base|]} [2020-12-23 16:45:32,820 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:45:32,821 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:32,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,843 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,845 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2020-12-23 16:45:32,849 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:32,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:32,865 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 16:45:32,867 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:40 [2020-12-23 16:45:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:33,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:45:33,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2020-12-23 16:45:33,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976063261] [2020-12-23 16:45:33,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 16:45:33,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:45:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 16:45:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2020-12-23 16:45:33,009 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 32 states. [2020-12-23 16:45:34,117 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2020-12-23 16:45:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:45:35,564 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2020-12-23 16:45:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 16:45:35,565 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2020-12-23 16:45:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:45:35,566 INFO L225 Difference]: With dead ends: 273 [2020-12-23 16:45:35,567 INFO L226 Difference]: Without dead ends: 273 [2020-12-23 16:45:35,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=575, Invalid=2617, Unknown=0, NotChecked=0, Total=3192 [2020-12-23 16:45:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-23 16:45:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 185. [2020-12-23 16:45:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-23 16:45:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 202 transitions. [2020-12-23 16:45:35,573 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 202 transitions. Word has length 38 [2020-12-23 16:45:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:45:35,573 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 202 transitions. [2020-12-23 16:45:35,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 16:45:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 202 transitions. [2020-12-23 16:45:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 16:45:35,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:45:35,574 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:45:35,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 16:45:35,789 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:45:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:45:35,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2008007850, now seen corresponding path program 1 times [2020-12-23 16:45:35,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:45:35,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789499304] [2020-12-23 16:45:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:45:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:36,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789499304] [2020-12-23 16:45:36,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885478890] [2020-12-23 16:45:36,136 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:45:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:45:36,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 64 conjunts are in the unsatisfiable core [2020-12-23 16:45:36,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:45:36,232 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:45:36,233 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,237 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-12-23 16:45:36,301 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,301 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 28 [2020-12-23 16:45:36,302 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,328 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2020-12-23 16:45:36,328 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,328 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2020-12-23 16:45:36,371 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 16:45:36,371 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,400 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 16:45:36,400 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,417 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:39 [2020-12-23 16:45:36,600 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,601 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 26 treesize of output 45 [2020-12-23 16:45:36,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,647 INFO L625 ElimStorePlain]: treesize reduction 27, result has 69.3 percent of original size [2020-12-23 16:45:36,661 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,661 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 28 treesize of output 39 [2020-12-23 16:45:36,663 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,711 INFO L625 ElimStorePlain]: treesize reduction 12, result has 82.6 percent of original size [2020-12-23 16:45:36,712 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,712 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:57 [2020-12-23 16:45:36,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:36,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:36,804 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,805 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 1 case distinctions, treesize of input 34 treesize of output 29 [2020-12-23 16:45:36,806 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:36,820 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2020-12-23 16:45:36,822 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,943 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-23 16:45:36,943 INFO L625 ElimStorePlain]: treesize reduction 31, result has 80.6 percent of original size [2020-12-23 16:45:36,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:36,953 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 27 treesize of output 11 [2020-12-23 16:45:36,954 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:36,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:36,967 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:36,967 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 1 case distinctions, treesize of input 34 treesize of output 29 [2020-12-23 16:45:36,969 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,051 INFO L625 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2020-12-23 16:45:37,052 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:37,052 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:91 [2020-12-23 16:45:37,104 INFO L443 ElimStorePlain]: Different costs {1=[|v_#valid_92|], 3=[|v_#length_65|]} [2020-12-23 16:45:37,114 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:37,114 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:45:37,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:37,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:37,118 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,128 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:37,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:45:37,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:37,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:37,131 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,249 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-12-23 16:45:37,250 INFO L625 ElimStorePlain]: treesize reduction 8, result has 93.3 percent of original size [2020-12-23 16:45:37,275 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:37,275 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 44 [2020-12-23 16:45:37,277 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,285 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2020-12-23 16:45:37,288 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,390 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-12-23 16:45:37,390 INFO L625 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2020-12-23 16:45:37,391 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:37,391 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:109 [2020-12-23 16:45:37,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 12, 1] term [2020-12-23 16:45:37,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:37,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:37,520 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:37,521 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 45 [2020-12-23 16:45:37,522 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,666 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-12-23 16:45:37,667 INFO L625 ElimStorePlain]: treesize reduction 24, result has 85.0 percent of original size [2020-12-23 16:45:37,697 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:37,697 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 45 [2020-12-23 16:45:37,699 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,705 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 11 [2020-12-23 16:45:37,706 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,841 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-12-23 16:45:37,842 INFO L625 ElimStorePlain]: treesize reduction 12, result has 91.3 percent of original size [2020-12-23 16:45:37,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2020-12-23 16:45:37,850 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:37,957 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-12-23 16:45:37,958 INFO L625 ElimStorePlain]: treesize reduction 12, result has 89.2 percent of original size [2020-12-23 16:45:37,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:37,959 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:147, output treesize:101 [2020-12-23 16:45:38,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 10, 1] term [2020-12-23 16:45:38,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:38,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 1] term [2020-12-23 16:45:38,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:38,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:38,225 INFO L443 ElimStorePlain]: Different costs {2=[v_prenex_6], 6=[|v_#memory_$Pointer$.offset_48|], 11=[|v_#memory_$Pointer$.base_61|]} [2020-12-23 16:45:38,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:38,233 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 16:45:38,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:38,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:38,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:45:38,310 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,310 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 30 treesize of output 68 [2020-12-23 16:45:38,312 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:38,414 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2020-12-23 16:45:38,415 INFO L625 ElimStorePlain]: treesize reduction 36, result has 80.5 percent of original size [2020-12-23 16:45:38,440 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,441 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 36 treesize of output 51 [2020-12-23 16:45:38,443 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:38,487 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,487 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 105 [2020-12-23 16:45:38,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:38,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:38,492 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:38,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:45:38,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:38,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:38,497 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:45:38,592 INFO L625 ElimStorePlain]: treesize reduction 52, result has 69.2 percent of original size [2020-12-23 16:45:38,596 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:45:38,596 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:103 [2020-12-23 16:45:38,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:38,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:45:38,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 9, 1] term [2020-12-23 16:45:38,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:38,697 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_62|], 6=[v_prenex_7, |v_#memory_$Pointer$.offset_49|], 12=[v_prenex_8]} [2020-12-23 16:45:38,722 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,723 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2020-12-23 16:45:38,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 16:45:38,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:38,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:38,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,818 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:38,818 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 159 [2020-12-23 16:45:38,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-12-23 16:45:38,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 16:45:38,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:45:38,824 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 16:45:38,824 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-12-23 16:45:38,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 16:45:38,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 16:45:38,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 16:45:38,828 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 16:45:38,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:38,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 16:45:38,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 16:45:38,831 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-12-23 16:45:38,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 16:45:38,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:38,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 16:45:38,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 16:45:38,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:38,839 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2020-12-23 16:45:39,204 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2020-12-23 16:45:39,205 INFO L625 ElimStorePlain]: treesize reduction 1080, result has 20.2 percent of original size [2020-12-23 16:45:39,216 INFO L348 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2020-12-23 16:45:39,216 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 1 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 16:45:39,217 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:39,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:39,515 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2020-12-23 16:45:39,516 INFO L348 Elim1Store]: treesize reduction 304, result has 50.4 percent of original size [2020-12-23 16:45:39,516 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 189 treesize of output 443 [2020-12-23 16:45:39,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 1] term [2020-12-23 16:45:39,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:45:39,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,539 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,541 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,546 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,548 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,549 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,550 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:39,551 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 16:45:39,552 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,555 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,560 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,563 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 16:45:39,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,567 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:39,571 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,576 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,577 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,578 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,581 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,583 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:39,584 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 16:45:39,586 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,587 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,589 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,593 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,596 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 16:45:39,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,599 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:39,602 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 16:45:39,607 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:39,608 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,610 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 16:45:39,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,611 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,613 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,615 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,616 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,619 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,620 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:45:39,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,623 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,626 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 16:45:39,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:45:39,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,630 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:45:39,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:45:39,634 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 16:45:39,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:45:39,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:39,642 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:45:39,644 INFO L443 ElimStorePlain]: Different costs {16=[v_arrayElimArr_1], 17=[v_arrayElimArr_2]} [2020-12-23 16:45:44,790 WARN L197 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2020-12-23 16:45:44,803 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_62|], 6=[|v_#memory_$Pointer$.offset_49|]} [2020-12-23 16:45:44,836 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:44,837 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2020-12-23 16:45:44,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 16:45:44,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:44,839 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:44,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:44,879 INFO L348 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2020-12-23 16:45:44,879 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 1 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 16:45:44,885 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:44,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:44,906 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:44,906 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:44 [2020-12-23 16:45:44,992 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_62|], 6=[|v_#memory_$Pointer$.offset_49|]} [2020-12-23 16:45:45,023 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,024 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2020-12-23 16:45:45,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 16:45:45,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:45,026 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:45,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,059 INFO L348 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2020-12-23 16:45:45,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 1 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 16:45:45,061 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:45,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:45,076 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:44 [2020-12-23 16:45:45,150 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_62|], 6=[|v_#memory_$Pointer$.offset_49|]} [2020-12-23 16:45:45,178 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,179 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2020-12-23 16:45:45,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-12-23 16:45:45,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:45:45,181 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:45,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,234 INFO L348 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2020-12-23 16:45:45,234 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 1 case distinctions, treesize of input 50 treesize of output 25 [2020-12-23 16:45:45,237 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:45,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,257 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:45,257 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:44 [2020-12-23 16:45:45,364 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2020-12-23 16:45:45,369 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 36 treesize of output 20 [2020-12-23 16:45:45,370 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:45,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,393 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 16:45:45,395 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:45:45,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:45:45,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:45:45,407 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:18 [2020-12-23 16:45:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:45:45,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:45:45,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2020-12-23 16:45:45,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312192540] [2020-12-23 16:45:45,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-23 16:45:45,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:45:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-23 16:45:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=977, Unknown=11, NotChecked=0, Total=1122 [2020-12-23 16:45:45,579 INFO L87 Difference]: Start difference. First operand 185 states and 202 transitions. Second operand 34 states. [2020-12-23 16:45:48,316 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2020-12-23 16:45:50,506 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2020-12-23 16:45:50,697 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2020-12-23 16:45:50,994 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2020-12-23 16:45:51,263 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2020-12-23 16:45:51,431 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2020-12-23 16:45:54,101 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2020-12-23 16:46:00,576 WARN L197 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-12-23 16:46:03,111 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-12-23 16:46:10,182 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2020-12-23 16:46:31,406 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-23 16:46:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:46:32,124 INFO L93 Difference]: Finished difference Result 252 states and 273 transitions. [2020-12-23 16:46:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 16:46:32,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2020-12-23 16:46:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:46:32,126 INFO L225 Difference]: With dead ends: 252 [2020-12-23 16:46:32,126 INFO L226 Difference]: Without dead ends: 252 [2020-12-23 16:46:32,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=517, Invalid=2524, Unknown=39, NotChecked=0, Total=3080 [2020-12-23 16:46:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-12-23 16:46:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 188. [2020-12-23 16:46:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 16:46:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 205 transitions. [2020-12-23 16:46:32,132 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 205 transitions. Word has length 38 [2020-12-23 16:46:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:46:32,133 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 205 transitions. [2020-12-23 16:46:32,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-23 16:46:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 205 transitions. [2020-12-23 16:46:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 16:46:32,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:46:32,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:46:32,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:46:32,335 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:46:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:46:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1159791222, now seen corresponding path program 1 times [2020-12-23 16:46:32,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:46:32,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291551353] [2020-12-23 16:46:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:46:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:46:32,616 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-12-23 16:46:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:46:33,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291551353] [2020-12-23 16:46:33,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219163708] [2020-12-23 16:46:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:46:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:46:33,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 16:46:33,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:46:33,092 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:46:33,093 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:33,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:33,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:33,109 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 16:46:33,159 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:33,159 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 28 [2020-12-23 16:46:33,160 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:33,212 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-12-23 16:46:33,213 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:33,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-12-23 16:46:33,402 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:33,402 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 58 [2020-12-23 16:46:33,404 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:33,475 INFO L625 ElimStorePlain]: treesize reduction 28, result has 44.0 percent of original size [2020-12-23 16:46:33,476 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:46:33,476 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2020-12-23 16:46:33,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:46:33,970 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-23 16:46:33,971 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:33,978 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:46:33,979 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:34,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:34,038 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:46:34,038 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:37 [2020-12-23 16:46:34,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:46:34,362 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 17 [2020-12-23 16:46:34,366 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:34,398 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-12-23 16:46:34,399 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:46:34,399 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-12-23 16:46:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:46:34,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:46:34,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2020-12-23 16:46:34,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660747097] [2020-12-23 16:46:34,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-23 16:46:34,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:46:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-23 16:46:34,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2020-12-23 16:46:34,535 INFO L87 Difference]: Start difference. First operand 188 states and 205 transitions. Second operand 23 states. [2020-12-23 16:46:35,638 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2020-12-23 16:46:36,014 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-12-23 16:46:36,347 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-12-23 16:46:36,773 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-12-23 16:46:37,101 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2020-12-23 16:46:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:46:38,770 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2020-12-23 16:46:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 16:46:38,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2020-12-23 16:46:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:46:38,772 INFO L225 Difference]: With dead ends: 216 [2020-12-23 16:46:38,773 INFO L226 Difference]: Without dead ends: 216 [2020-12-23 16:46:38,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 16:46:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-12-23 16:46:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2020-12-23 16:46:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-23 16:46:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-12-23 16:46:38,780 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 40 [2020-12-23 16:46:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:46:38,780 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-12-23 16:46:38,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-23 16:46:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-12-23 16:46:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 16:46:38,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:46:38,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:46:38,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 16:46:38,995 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:46:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:46:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1159791221, now seen corresponding path program 1 times [2020-12-23 16:46:38,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:46:38,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404385919] [2020-12-23 16:46:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:46:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:46:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:46:39,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404385919] [2020-12-23 16:46:39,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891705021] [2020-12-23 16:46:39,905 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:46:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:46:39,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 41 conjunts are in the unsatisfiable core [2020-12-23 16:46:39,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:46:39,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:46:39,979 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:39,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:39,991 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:39,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 16:46:40,140 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:40,141 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 28 [2020-12-23 16:46:40,141 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:40,184 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-12-23 16:46:40,185 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:40,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-12-23 16:46:40,395 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:40,396 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 58 [2020-12-23 16:46:40,400 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:40,472 INFO L625 ElimStorePlain]: treesize reduction 28, result has 44.0 percent of original size [2020-12-23 16:46:40,473 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:46:40,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2020-12-23 16:46:41,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:46:41,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:46:41,129 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2020-12-23 16:46:41,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:41,135 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:46:41,136 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:41,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:41,216 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2020-12-23 16:46:41,216 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:41,222 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2020-12-23 16:46:41,223 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:41,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:41,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-23 16:46:41,289 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:43 [2020-12-23 16:46:41,549 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2020-12-23 16:46:41,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:46:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:46:41,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:46:41,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2020-12-23 16:46:41,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509774329] [2020-12-23 16:46:41,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 16:46:41,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:46:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 16:46:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2020-12-23 16:46:41,873 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 28 states. [2020-12-23 16:46:42,690 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-12-23 16:46:42,896 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2020-12-23 16:46:43,125 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-12-23 16:46:43,834 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2020-12-23 16:46:44,135 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2020-12-23 16:46:44,657 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2020-12-23 16:46:44,915 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2020-12-23 16:46:45,320 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-23 16:46:45,614 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-23 16:46:46,174 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2020-12-23 16:46:47,177 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2020-12-23 16:46:47,518 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2020-12-23 16:46:47,740 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-23 16:46:48,332 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-12-23 16:46:48,724 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-23 16:46:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:46:49,814 INFO L93 Difference]: Finished difference Result 288 states and 311 transitions. [2020-12-23 16:46:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-23 16:46:49,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2020-12-23 16:46:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:46:49,816 INFO L225 Difference]: With dead ends: 288 [2020-12-23 16:46:49,816 INFO L226 Difference]: Without dead ends: 288 [2020-12-23 16:46:49,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=804, Invalid=3102, Unknown=0, NotChecked=0, Total=3906 [2020-12-23 16:46:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-23 16:46:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 184. [2020-12-23 16:46:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-12-23 16:46:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2020-12-23 16:46:49,823 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 40 [2020-12-23 16:46:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:46:49,823 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2020-12-23 16:46:49,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-23 16:46:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2020-12-23 16:46:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 16:46:49,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:46:49,824 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:46:50,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:46:50,038 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:46:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:46:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1294044070, now seen corresponding path program 1 times [2020-12-23 16:46:50,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:46:50,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484650991] [2020-12-23 16:46:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:46:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:46:50,451 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-23 16:46:50,588 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-23 16:46:50,741 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2020-12-23 16:46:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 16:46:51,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484650991] [2020-12-23 16:46:51,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110115480] [2020-12-23 16:46:51,940 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:46:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:46:52,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-23 16:46:52,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:46:52,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:46:52,026 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-23 16:46:52,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 16:46:52,068 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,082 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,082 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-23 16:46:52,230 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2020-12-23 16:46:52,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:46:52,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2020-12-23 16:46:52,337 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_63|], 2=[|v_#memory_int_49|]} [2020-12-23 16:46:52,345 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 16:46:52,346 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,424 INFO L625 ElimStorePlain]: treesize reduction 5, result has 91.2 percent of original size [2020-12-23 16:46:52,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:46:52,435 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:46:52,435 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,470 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:38 [2020-12-23 16:46:52,552 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:46:52,553 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,579 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 16:46:52,579 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2020-12-23 16:46:52,721 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 25 treesize of output 13 [2020-12-23 16:46:52,722 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,741 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,742 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2020-12-23 16:46:52,754 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 16:46:52,755 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:52,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-12-23 16:46:52,957 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:52,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 69 [2020-12-23 16:46:52,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:46:52,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:46:52,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,003 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,003 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:46 [2020-12-23 16:46:53,101 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_64|], 6=[|v_#memory_int_52|]} [2020-12-23 16:46:53,109 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 16:46:53,109 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,156 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:46:53,169 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 16:46:53,170 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,212 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:58 [2020-12-23 16:46:53,317 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2020-12-23 16:46:53,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,356 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 16:46:53,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:46 [2020-12-23 16:46:53,608 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2020-12-23 16:46:53,609 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,649 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 16:46:53,649 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:46 [2020-12-23 16:46:53,774 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 16:46:53,775 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:53,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,817 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 16:46:53,817 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:55 [2020-12-23 16:46:53,990 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:53,991 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-12-23 16:46:53,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:46:53,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:46:53,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:46:53,996 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:54,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:54,040 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 16:46:54,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2020-12-23 16:46:54,154 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_65|], 12=[|v_#memory_int_55|]} [2020-12-23 16:46:54,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, 5 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 16:46:54,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:54,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:54,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:46:54,249 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2020-12-23 16:46:54,250 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:54,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:54,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 16:46:54,315 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:64 [2020-12-23 16:46:54,473 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2020-12-23 16:46:54,474 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:54,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:54,542 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 16:46:54,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:52 [2020-12-23 16:46:54,901 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2020-12-23 16:46:54,902 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:54,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:54,960 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 16:46:54,960 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2020-12-23 16:46:55,093 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2020-12-23 16:46:55,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:55,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:55,142 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-12-23 16:46:55,143 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:61 [2020-12-23 16:46:55,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 16 [2020-12-23 16:46:55,729 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:46:55,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:46:55,774 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:46:55,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:70, output treesize:3 [2020-12-23 16:46:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:46:55,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:46:55,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2020-12-23 16:46:55,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880276512] [2020-12-23 16:46:55,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-23 16:46:55,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:46:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-23 16:46:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2020-12-23 16:46:55,797 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 41 states. [2020-12-23 16:46:56,958 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-12-23 16:47:43,952 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2020-12-23 16:47:50,646 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-12-23 16:48:05,065 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2020-12-23 16:48:11,816 WARN L197 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2020-12-23 16:48:12,093 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-12-23 16:48:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:48:17,191 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2020-12-23 16:48:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-12-23 16:48:17,192 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2020-12-23 16:48:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:48:17,193 INFO L225 Difference]: With dead ends: 256 [2020-12-23 16:48:17,193 INFO L226 Difference]: Without dead ends: 256 [2020-12-23 16:48:17,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1331, Invalid=6150, Unknown=1, NotChecked=0, Total=7482 [2020-12-23 16:48:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-12-23 16:48:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2020-12-23 16:48:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 16:48:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2020-12-23 16:48:17,199 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 40 [2020-12-23 16:48:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:48:17,199 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2020-12-23 16:48:17,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-23 16:48:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2020-12-23 16:48:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 16:48:17,200 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:48:17,200 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:48:17,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-12-23 16:48:17,417 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:48:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:48:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash -104186363, now seen corresponding path program 3 times [2020-12-23 16:48:17,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:48:17,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362681209] [2020-12-23 16:48:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:48:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:48:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:48:18,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362681209] [2020-12-23 16:48:18,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139551384] [2020-12-23 16:48:18,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:48:18,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-23 16:48:18,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:48:18,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2020-12-23 16:48:18,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:48:18,843 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:48:18,844 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:18,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:18,872 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:18,873 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2020-12-23 16:48:18,970 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 16:48:18,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:19,022 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 16:48:19,023 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:19,073 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,074 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2020-12-23 16:48:19,182 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 16:48:19,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:19,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:31 [2020-12-23 16:48:19,419 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:19,460 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:19,461 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 28 treesize of output 39 [2020-12-23 16:48:19,462 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,561 INFO L625 ElimStorePlain]: treesize reduction 12, result has 76.0 percent of original size [2020-12-23 16:48:19,562 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2020-12-23 16:48:19,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:48:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:19,713 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 27 treesize of output 11 [2020-12-23 16:48:19,714 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:19,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:19,739 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:19,751 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:19,751 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 1 case distinctions, treesize of input 34 treesize of output 29 [2020-12-23 16:48:19,760 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:19,939 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-12-23 16:48:19,940 INFO L625 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2020-12-23 16:48:19,940 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:48:19,940 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:60 [2020-12-23 16:48:20,033 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:20,091 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:20,092 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2020-12-23 16:48:20,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:20,095 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:20,280 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-12-23 16:48:20,281 INFO L348 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2020-12-23 16:48:20,281 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 69 [2020-12-23 16:48:20,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:48:20,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:20,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:48:20,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:48:20,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:48:20,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:20,295 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:20,522 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-23 16:48:20,523 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-12-23 16:48:20,523 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:48:20,523 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:82 [2020-12-23 16:48:20,709 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-23 16:48:20,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:20,733 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 11 [2020-12-23 16:48:20,737 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:20,751 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:20,795 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:20,795 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 2 case distinctions, treesize of input 26 treesize of output 45 [2020-12-23 16:48:20,797 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:21,009 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2020-12-23 16:48:21,010 INFO L625 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2020-12-23 16:48:21,011 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:48:21,011 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:88 [2020-12-23 16:48:21,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 1] term [2020-12-23 16:48:21,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:21,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:21,612 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:21,613 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 36 treesize of output 51 [2020-12-23 16:48:21,614 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:21,638 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:21,732 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:21,732 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 102 [2020-12-23 16:48:21,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 16:48:21,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:48:21,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 16:48:21,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:48:21,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:48:21,738 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:21,927 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-23 16:48:21,927 INFO L625 ElimStorePlain]: treesize reduction 8, result has 92.0 percent of original size [2020-12-23 16:48:21,929 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:48:21,930 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:78 [2020-12-23 16:48:22,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2020-12-23 16:48:22,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:22,030 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_71|], 6=[v_prenex_11]} [2020-12-23 16:48:22,080 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:22,081 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2020-12-23 16:48:22,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-12-23 16:48:22,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 16:48:22,082 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:22,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:22,164 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:22,266 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-23 16:48:22,266 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:22,267 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 130 [2020-12-23 16:48:22,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:48:22,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 16:48:22,271 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 16:48:22,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 16:48:22,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:48:22,273 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 16:48:22,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 16:48:22,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 16:48:22,276 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-12-23 16:48:22,433 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2020-12-23 16:48:22,434 INFO L625 ElimStorePlain]: treesize reduction 167, result has 32.4 percent of original size [2020-12-23 16:48:22,434 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-23 16:48:22,434 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:166, output treesize:80 [2020-12-23 16:48:22,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:22,785 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:22,799 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:22,799 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2020-12-23 16:48:22,801 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 16:48:22,809 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 16:48:22,810 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-12-23 16:48:22,811 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:22,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:22,914 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-12-23 16:48:22,914 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:40 [2020-12-23 16:48:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:48:23,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 16:48:23,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2020-12-23 16:48:23,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766317334] [2020-12-23 16:48:23,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-23 16:48:23,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:48:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-23 16:48:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 16:48:23,191 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 33 states. [2020-12-23 16:48:23,917 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-12-23 16:48:24,154 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2020-12-23 16:48:24,331 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-12-23 16:48:24,525 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2020-12-23 16:48:24,868 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-12-23 16:48:25,076 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2020-12-23 16:48:25,316 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2020-12-23 16:48:25,702 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-12-23 16:48:26,064 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-23 16:48:26,711 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-12-23 16:48:26,861 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2020-12-23 16:48:27,777 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2020-12-23 16:48:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:48:29,539 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2020-12-23 16:48:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 16:48:29,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2020-12-23 16:48:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:48:29,541 INFO L225 Difference]: With dead ends: 258 [2020-12-23 16:48:29,541 INFO L226 Difference]: Without dead ends: 258 [2020-12-23 16:48:29,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=638, Invalid=2668, Unknown=0, NotChecked=0, Total=3306 [2020-12-23 16:48:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-12-23 16:48:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 190. [2020-12-23 16:48:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-12-23 16:48:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 207 transitions. [2020-12-23 16:48:29,547 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 207 transitions. Word has length 41 [2020-12-23 16:48:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:48:29,547 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 207 transitions. [2020-12-23 16:48:29,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-23 16:48:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 207 transitions. [2020-12-23 16:48:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 16:48:29,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:48:29,548 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:48:29,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-23 16:48:29,761 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-12-23 16:48:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:48:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash -104186362, now seen corresponding path program 2 times [2020-12-23 16:48:29,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:48:29,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146116175] [2020-12-23 16:48:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:48:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:48:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:48:30,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146116175] [2020-12-23 16:48:30,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695603067] [2020-12-23 16:48:30,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:48:30,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:48:30,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:48:30,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 60 conjunts are in the unsatisfiable core [2020-12-23 16:48:30,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:48:30,748 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-12-23 16:48:30,749 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:30,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:30,774 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:30,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-12-23 16:48:31,074 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,074 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2020-12-23 16:48:31,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:31,079 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2020-12-23 16:48:31,235 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 16:48:31,242 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,306 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 16:48:31,306 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,355 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:41 [2020-12-23 16:48:31,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:31,692 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 16:48:31,693 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,801 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,802 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 36 treesize of output 51 [2020-12-23 16:48:31,803 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:31,856 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:31,856 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:58 [2020-12-23 16:48:32,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:32,003 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 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 16:48:32,004 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:32,080 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 0 case distinctions, treesize of input 34 treesize of output 21 [2020-12-23 16:48:32,080 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,141 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,141 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2020-12-23 16:48:32,289 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_69|], 3=[|v_#valid_105|]} [2020-12-23 16:48:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:48:32,298 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-12-23 16:48:32,299 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,421 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,421 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-12-23 16:48:32,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 16:48:32,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:48:32,425 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,489 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2020-12-23 16:48:32,646 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 16:48:32,649 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,728 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-12-23 16:48:32,731 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:48:32,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:48:32,793 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:66