/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:32:57,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:32:57,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:32:57,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:32:57,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:32:57,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:32:57,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:32:57,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:32:57,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:32:57,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:32:57,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:32:57,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:32:57,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:32:57,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:32:57,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:32:57,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:32:57,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:32:57,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:32:57,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:32:57,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:32:57,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:32:57,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:32:57,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:32:57,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:32:57,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:32:57,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:32:57,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:32:57,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:32:57,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:32:57,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:32:57,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:32:57,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:32:57,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:32:57,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:32:57,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:32:57,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:32:57,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:32:57,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:32:57,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:32:57,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:32:57,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:32:57,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:32:57,416 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:32:57,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:32:57,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:32:57,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:32:57,419 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:32:57,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:32:57,420 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:32:57,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:32:57,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:32:57,421 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:32:57,421 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:32:57,421 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:32:57,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:32:57,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:32:57,422 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:32:57,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:32:57,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:32:57,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:32:57,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:32:57,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:32:57,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:32:57,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:32:57,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:32:57,424 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:32:57,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 05:32:57,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:32:58,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:32:58,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:32:58,021 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:32:58,022 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:32:58,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2021-01-07 05:32:58,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d2bebd2b4/38b104c4df7d4c7fbdc34ae49bb51f3b/FLAG54ab4ae6f [2021-01-07 05:32:59,070 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:32:59,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2021-01-07 05:32:59,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d2bebd2b4/38b104c4df7d4c7fbdc34ae49bb51f3b/FLAG54ab4ae6f [2021-01-07 05:32:59,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d2bebd2b4/38b104c4df7d4c7fbdc34ae49bb51f3b [2021-01-07 05:32:59,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:32:59,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:32:59,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:32:59,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:32:59,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:32:59,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:32:59" (1/1) ... [2021-01-07 05:32:59,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf5b0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:32:59, skipping insertion in model container [2021-01-07 05:32:59,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:32:59" (1/1) ... [2021-01-07 05:32:59,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:32:59,381 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~old_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~old_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~1,],base],StructAccessExpression[IdentifierExpression[~last~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2021-01-07 05:32:59,840 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/list-simple/dll2c_prepend_unequal.i[24729,24742] [2021-01-07 05:32:59,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:32:59,859 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~old_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~old_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~1,],base],StructAccessExpression[IdentifierExpression[~last~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2021-01-07 05:32:59,943 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/list-simple/dll2c_prepend_unequal.i[24729,24742] [2021-01-07 05:32:59,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:33:00,011 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:33:00,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00 WrapperNode [2021-01-07 05:33:00,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:33:00,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:33:00,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:33:00,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:33:00,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:33:00,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:33:00,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:33:00,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:33:00,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... [2021-01-07 05:33:00,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:33:00,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:33:00,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:33:00,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:33:00,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:33:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:33:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:33:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:33:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:33:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:33:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:33:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:33:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:33:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:33:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:33:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:33:01,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:33:01,200 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-01-07 05:33:01,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:01 BoogieIcfgContainer [2021-01-07 05:33:01,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:33:01,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:33:01,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:33:01,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:33:01,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:32:59" (1/3) ... [2021-01-07 05:33:01,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb47e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:33:01, skipping insertion in model container [2021-01-07 05:33:01,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:00" (2/3) ... [2021-01-07 05:33:01,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb47e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:33:01, skipping insertion in model container [2021-01-07 05:33:01,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:01" (3/3) ... [2021-01-07 05:33:01,212 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2021-01-07 05:33:01,219 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:33:01,225 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 76 error locations. [2021-01-07 05:33:01,248 INFO L253 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2021-01-07 05:33:01,274 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:33:01,275 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:33:01,275 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:33:01,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:33:01,275 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:33:01,275 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:33:01,275 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:33:01,276 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:33:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2021-01-07 05:33:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:33:01,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:01,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:33:01,306 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-01-07 05:33:01,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:01,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131986339] [2021-01-07 05:33:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:01,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131986339] [2021-01-07 05:33:01,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:01,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:33:01,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827775863] [2021-01-07 05:33:01,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:01,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:01,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:01,552 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 3 states. [2021-01-07 05:33:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:01,797 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-01-07 05:33:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:01,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:33:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:01,812 INFO L225 Difference]: With dead ends: 164 [2021-01-07 05:33:01,812 INFO L226 Difference]: Without dead ends: 159 [2021-01-07 05:33:01,814 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 [2021-01-07 05:33:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-07 05:33:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2021-01-07 05:33:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-07 05:33:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2021-01-07 05:33:01,903 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 4 [2021-01-07 05:33:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:01,905 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2021-01-07 05:33:01,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2021-01-07 05:33:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:33:01,906 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:01,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:33:01,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:33:01,908 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:01,912 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-01-07 05:33:01,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:01,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735778353] [2021-01-07 05:33:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:01,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735778353] [2021-01-07 05:33:01,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:01,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:33:01,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732471936] [2021-01-07 05:33:01,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:01,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:01,982 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 3 states. [2021-01-07 05:33:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:02,158 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2021-01-07 05:33:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:02,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:33:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:02,160 INFO L225 Difference]: With dead ends: 132 [2021-01-07 05:33:02,160 INFO L226 Difference]: Without dead ends: 132 [2021-01-07 05:33:02,161 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 [2021-01-07 05:33:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-01-07 05:33:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-01-07 05:33:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-07 05:33:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2021-01-07 05:33:02,171 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 4 [2021-01-07 05:33:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:02,171 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2021-01-07 05:33:02,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2021-01-07 05:33:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:33:02,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:02,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:02,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:33:02,173 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 613332465, now seen corresponding path program 1 times [2021-01-07 05:33:02,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:02,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591179764] [2021-01-07 05:33:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:02,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591179764] [2021-01-07 05:33:02,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:02,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:33:02,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444171464] [2021-01-07 05:33:02,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:02,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:02,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:02,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:02,242 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 3 states. [2021-01-07 05:33:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:02,254 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2021-01-07 05:33:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:02,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 05:33:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:02,256 INFO L225 Difference]: With dead ends: 147 [2021-01-07 05:33:02,256 INFO L226 Difference]: Without dead ends: 147 [2021-01-07 05:33:02,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-07 05:33:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2021-01-07 05:33:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-01-07 05:33:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-01-07 05:33:02,267 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 10 [2021-01-07 05:33:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:02,267 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-01-07 05:33:02,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-01-07 05:33:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:33:02,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:02,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:02,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:33:02,270 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1103137848, now seen corresponding path program 1 times [2021-01-07 05:33:02,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:02,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827840299] [2021-01-07 05:33:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:02,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827840299] [2021-01-07 05:33:02,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:02,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:02,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757187664] [2021-01-07 05:33:02,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:02,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:02,376 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 5 states. [2021-01-07 05:33:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:02,607 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2021-01-07 05:33:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:02,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:33:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:02,609 INFO L225 Difference]: With dead ends: 156 [2021-01-07 05:33:02,609 INFO L226 Difference]: Without dead ends: 156 [2021-01-07 05:33:02,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-07 05:33:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2021-01-07 05:33:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-07 05:33:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2021-01-07 05:33:02,618 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 16 [2021-01-07 05:33:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:02,618 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2021-01-07 05:33:02,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2021-01-07 05:33:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:33:02,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:02,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:02,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:33:02,620 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1103137849, now seen corresponding path program 1 times [2021-01-07 05:33:02,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:02,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587941951] [2021-01-07 05:33:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:02,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587941951] [2021-01-07 05:33:02,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:02,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:02,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285229749] [2021-01-07 05:33:02,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:02,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:02,707 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 5 states. [2021-01-07 05:33:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:02,911 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2021-01-07 05:33:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:02,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:33:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:02,913 INFO L225 Difference]: With dead ends: 137 [2021-01-07 05:33:02,913 INFO L226 Difference]: Without dead ends: 137 [2021-01-07 05:33:02,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-01-07 05:33:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2021-01-07 05:33:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-01-07 05:33:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2021-01-07 05:33:02,935 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 16 [2021-01-07 05:33:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:02,936 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2021-01-07 05:33:02,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2021-01-07 05:33:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:33:02,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:02,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:02,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:33:02,938 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash -741449383, now seen corresponding path program 1 times [2021-01-07 05:33:02,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:02,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421721562] [2021-01-07 05:33:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:03,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421721562] [2021-01-07 05:33:03,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:03,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:03,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527836243] [2021-01-07 05:33:03,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:03,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:03,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:03,163 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 6 states. [2021-01-07 05:33:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:03,417 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2021-01-07 05:33:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:03,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:33:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:03,419 INFO L225 Difference]: With dead ends: 160 [2021-01-07 05:33:03,419 INFO L226 Difference]: Without dead ends: 160 [2021-01-07 05:33:03,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-07 05:33:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2021-01-07 05:33:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-01-07 05:33:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2021-01-07 05:33:03,425 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 18 [2021-01-07 05:33:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:03,425 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2021-01-07 05:33:03,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2021-01-07 05:33:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:33:03,426 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:03,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:03,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:33:03,427 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash -741449382, now seen corresponding path program 1 times [2021-01-07 05:33:03,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:03,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27687586] [2021-01-07 05:33:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:03,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27687586] [2021-01-07 05:33:03,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:03,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:03,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62794108] [2021-01-07 05:33:03,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:03,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:03,580 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2021-01-07 05:33:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:03,825 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2021-01-07 05:33:03,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:03,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-07 05:33:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:03,827 INFO L225 Difference]: With dead ends: 141 [2021-01-07 05:33:03,827 INFO L226 Difference]: Without dead ends: 141 [2021-01-07 05:33:03,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-01-07 05:33:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2021-01-07 05:33:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-01-07 05:33:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2021-01-07 05:33:03,832 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 18 [2021-01-07 05:33:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:03,833 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2021-01-07 05:33:03,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2021-01-07 05:33:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:33:03,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:03,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] [2021-01-07 05:33:03,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:33:03,835 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 431868768, now seen corresponding path program 1 times [2021-01-07 05:33:03,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:03,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39372192] [2021-01-07 05:33:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:03,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39372192] [2021-01-07 05:33:03,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:03,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:33:03,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082254500] [2021-01-07 05:33:03,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:03,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:03,900 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 6 states. [2021-01-07 05:33:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:04,054 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2021-01-07 05:33:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:04,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-07 05:33:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:04,057 INFO L225 Difference]: With dead ends: 141 [2021-01-07 05:33:04,057 INFO L226 Difference]: Without dead ends: 141 [2021-01-07 05:33:04,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-01-07 05:33:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2021-01-07 05:33:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-01-07 05:33:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2021-01-07 05:33:04,068 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 20 [2021-01-07 05:33:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:04,069 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2021-01-07 05:33:04,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2021-01-07 05:33:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:33:04,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:04,070 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] [2021-01-07 05:33:04,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:33:04,070 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash 498265101, now seen corresponding path program 1 times [2021-01-07 05:33:04,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:04,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691570534] [2021-01-07 05:33:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:04,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691570534] [2021-01-07 05:33:04,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051855278] [2021-01-07 05:33:04,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:04,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 05:33:04,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:04,428 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:33:04,428 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 1 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:04,432 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:04,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:04,450 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. [2021-01-07 05:33:04,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2021-01-07 05:33:04,542 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:04,543 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 [2021-01-07 05:33:04,546 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:04,564 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 05:33:04,566 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. [2021-01-07 05:33:04,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 05:33:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:04,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:04,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-07 05:33:04,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856617958] [2021-01-07 05:33:04,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:33:04,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:33:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:04,602 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 8 states. [2021-01-07 05:33:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:04,925 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2021-01-07 05:33:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:33:04,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2021-01-07 05:33:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:04,927 INFO L225 Difference]: With dead ends: 159 [2021-01-07 05:33:04,927 INFO L226 Difference]: Without dead ends: 159 [2021-01-07 05:33:04,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:33:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-07 05:33:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2021-01-07 05:33:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-07 05:33:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2021-01-07 05:33:04,933 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 21 [2021-01-07 05:33:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:04,933 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2021-01-07 05:33:04,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:33:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2021-01-07 05:33:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:33:04,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:04,934 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] [2021-01-07 05:33:05,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 05:33:05,151 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash 498265102, now seen corresponding path program 1 times [2021-01-07 05:33:05,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:05,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123730375] [2021-01-07 05:33:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:05,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123730375] [2021-01-07 05:33:05,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654355806] [2021-01-07 05:33:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:05,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 05:33:05,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:05,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:05,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-01-07 05:33:05,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464985608] [2021-01-07 05:33:05,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:05,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:05,592 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 10 states. [2021-01-07 05:33:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:05,974 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2021-01-07 05:33:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:05,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2021-01-07 05:33:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:05,976 INFO L225 Difference]: With dead ends: 147 [2021-01-07 05:33:05,976 INFO L226 Difference]: Without dead ends: 147 [2021-01-07 05:33:05,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:33:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-07 05:33:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2021-01-07 05:33:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-07 05:33:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2021-01-07 05:33:05,981 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 21 [2021-01-07 05:33:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:05,981 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2021-01-07 05:33:05,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2021-01-07 05:33:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:33:05,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:05,982 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] [2021-01-07 05:33:06,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 05:33:06,196 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:06,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1733651014, now seen corresponding path program 1 times [2021-01-07 05:33:06,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:06,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202896456] [2021-01-07 05:33:06,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:06,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202896456] [2021-01-07 05:33:06,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:06,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:06,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62359062] [2021-01-07 05:33:06,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:06,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:06,261 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 6 states. [2021-01-07 05:33:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:06,531 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2021-01-07 05:33:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:06,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 05:33:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:06,533 INFO L225 Difference]: With dead ends: 158 [2021-01-07 05:33:06,533 INFO L226 Difference]: Without dead ends: 158 [2021-01-07 05:33:06,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-01-07 05:33:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2021-01-07 05:33:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-01-07 05:33:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2021-01-07 05:33:06,543 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 22 [2021-01-07 05:33:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:06,545 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2021-01-07 05:33:06,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2021-01-07 05:33:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:33:06,546 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:06,547 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] [2021-01-07 05:33:06,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:33:06,547 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1733651013, now seen corresponding path program 1 times [2021-01-07 05:33:06,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:06,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229859994] [2021-01-07 05:33:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:06,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229859994] [2021-01-07 05:33:06,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:06,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:06,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370498325] [2021-01-07 05:33:06,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:06,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:06,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:06,707 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 6 states. [2021-01-07 05:33:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:07,003 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2021-01-07 05:33:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:07,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 05:33:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:07,007 INFO L225 Difference]: With dead ends: 138 [2021-01-07 05:33:07,008 INFO L226 Difference]: Without dead ends: 138 [2021-01-07 05:33:07,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-01-07 05:33:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-01-07 05:33:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-01-07 05:33:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2021-01-07 05:33:07,014 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 22 [2021-01-07 05:33:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:07,014 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2021-01-07 05:33:07,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2021-01-07 05:33:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:33:07,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:07,024 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] [2021-01-07 05:33:07,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:33:07,025 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1584590306, now seen corresponding path program 1 times [2021-01-07 05:33:07,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:07,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376417469] [2021-01-07 05:33:07,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:07,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376417469] [2021-01-07 05:33:07,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:07,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:33:07,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456797075] [2021-01-07 05:33:07,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:07,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:07,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:07,213 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 4 states. [2021-01-07 05:33:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:07,392 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-01-07 05:33:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:07,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:33:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:07,396 INFO L225 Difference]: With dead ends: 130 [2021-01-07 05:33:07,396 INFO L226 Difference]: Without dead ends: 130 [2021-01-07 05:33:07,397 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 [2021-01-07 05:33:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-01-07 05:33:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-01-07 05:33:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-07 05:33:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2021-01-07 05:33:07,401 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 31 [2021-01-07 05:33:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:07,401 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2021-01-07 05:33:07,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2021-01-07 05:33:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:33:07,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:07,402 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] [2021-01-07 05:33:07,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:33:07,403 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1584590307, now seen corresponding path program 1 times [2021-01-07 05:33:07,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:07,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988995425] [2021-01-07 05:33:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:07,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988995425] [2021-01-07 05:33:07,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047804617] [2021-01-07 05:33:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:07,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-07 05:33:07,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:07,624 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:33:07,624 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 1 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:07,626 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:07,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:07,632 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:07,632 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:11 [2021-01-07 05:33:07,721 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:07,721 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 [2021-01-07 05:33:07,724 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:07,738 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:33:07,739 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. [2021-01-07 05:33:07,739 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:33:07,781 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:07,781 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 [2021-01-07 05:33:07,783 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:07,798 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:33:07,800 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. [2021-01-07 05:33:07,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:33:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:07,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:07,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2021-01-07 05:33:07,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227151550] [2021-01-07 05:33:07,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:07,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:33:07,819 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2021-01-07 05:33:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:08,016 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2021-01-07 05:33:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:08,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2021-01-07 05:33:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:08,018 INFO L225 Difference]: With dead ends: 140 [2021-01-07 05:33:08,019 INFO L226 Difference]: Without dead ends: 140 [2021-01-07 05:33:08,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-01-07 05:33:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-01-07 05:33:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-01-07 05:33:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2021-01-07 05:33:08,026 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 31 [2021-01-07 05:33:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:08,026 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2021-01-07 05:33:08,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2021-01-07 05:33:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:33:08,027 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:08,027 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:08,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:33:08,243 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2090471037, now seen corresponding path program 1 times [2021-01-07 05:33:08,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:08,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326133714] [2021-01-07 05:33:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:08,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326133714] [2021-01-07 05:33:08,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442860249] [2021-01-07 05:33:08,289 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 [2021-01-07 05:33:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:08,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:33:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:08,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:08,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 05:33:08,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745629077] [2021-01-07 05:33:08,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:08,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:08,473 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2021-01-07 05:33:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:08,485 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2021-01-07 05:33:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:33:08,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:33:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:08,487 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:33:08,487 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:33:08,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:33:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-01-07 05:33:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-07 05:33:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2021-01-07 05:33:08,496 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 31 [2021-01-07 05:33:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:08,497 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2021-01-07 05:33:08,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2021-01-07 05:33:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:08,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:08,499 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] [2021-01-07 05:33:08,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:08,715 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash -544216949, now seen corresponding path program 1 times [2021-01-07 05:33:08,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:08,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707419097] [2021-01-07 05:33:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:08,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707419097] [2021-01-07 05:33:08,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:08,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:08,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912281975] [2021-01-07 05:33:08,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:08,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:08,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:08,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:08,780 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 5 states. [2021-01-07 05:33:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:08,920 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2021-01-07 05:33:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:08,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-01-07 05:33:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:08,921 INFO L225 Difference]: With dead ends: 123 [2021-01-07 05:33:08,921 INFO L226 Difference]: Without dead ends: 123 [2021-01-07 05:33:08,922 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 [2021-01-07 05:33:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-07 05:33:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2021-01-07 05:33:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-07 05:33:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2021-01-07 05:33:08,925 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 34 [2021-01-07 05:33:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:08,925 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-01-07 05:33:08,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2021-01-07 05:33:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:08,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:08,927 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] [2021-01-07 05:33:08,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:33:08,927 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash -544216948, now seen corresponding path program 1 times [2021-01-07 05:33:08,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:08,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230683428] [2021-01-07 05:33:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:09,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230683428] [2021-01-07 05:33:09,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:09,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:09,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341087555] [2021-01-07 05:33:09,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:09,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:09,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:09,018 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 6 states. [2021-01-07 05:33:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:09,179 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-01-07 05:33:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:09,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2021-01-07 05:33:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:09,181 INFO L225 Difference]: With dead ends: 101 [2021-01-07 05:33:09,181 INFO L226 Difference]: Without dead ends: 101 [2021-01-07 05:33:09,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-01-07 05:33:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-01-07 05:33:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-01-07 05:33:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-01-07 05:33:09,184 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 34 [2021-01-07 05:33:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:09,184 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-01-07 05:33:09,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-01-07 05:33:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:09,185 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:09,185 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] [2021-01-07 05:33:09,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:33:09,186 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -544206026, now seen corresponding path program 1 times [2021-01-07 05:33:09,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:09,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060364647] [2021-01-07 05:33:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:09,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060364647] [2021-01-07 05:33:09,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:09,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:33:09,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545697042] [2021-01-07 05:33:09,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:33:09,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:33:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:09,338 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 11 states. [2021-01-07 05:33:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:09,897 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2021-01-07 05:33:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:33:09,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2021-01-07 05:33:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:09,899 INFO L225 Difference]: With dead ends: 118 [2021-01-07 05:33:09,899 INFO L226 Difference]: Without dead ends: 118 [2021-01-07 05:33:09,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:33:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-07 05:33:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2021-01-07 05:33:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-07 05:33:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2021-01-07 05:33:09,902 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 34 [2021-01-07 05:33:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:09,903 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2021-01-07 05:33:09,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:33:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2021-01-07 05:33:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:09,903 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:09,903 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] [2021-01-07 05:33:09,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:33:09,904 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -544206025, now seen corresponding path program 1 times [2021-01-07 05:33:09,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:09,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617461592] [2021-01-07 05:33:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:10,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617461592] [2021-01-07 05:33:10,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:33:10,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564613084] [2021-01-07 05:33:10,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:33:10,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:33:10,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:33:10,166 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 12 states. [2021-01-07 05:33:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,001 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-01-07 05:33:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:33:11,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2021-01-07 05:33:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,003 INFO L225 Difference]: With dead ends: 117 [2021-01-07 05:33:11,003 INFO L226 Difference]: Without dead ends: 117 [2021-01-07 05:33:11,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:33:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-01-07 05:33:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-01-07 05:33:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-01-07 05:33:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-01-07 05:33:11,006 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 34 [2021-01-07 05:33:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,007 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-01-07 05:33:11,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:33:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-01-07 05:33:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:33:11,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,008 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, 1, 1, 1] [2021-01-07 05:33:11,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:33:11,008 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1294391949, now seen corresponding path program 1 times [2021-01-07 05:33:11,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522795817] [2021-01-07 05:33:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:11,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522795817] [2021-01-07 05:33:11,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:11,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 05:33:11,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741627957] [2021-01-07 05:33:11,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:33:11,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:11,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:33:11,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:33:11,237 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 12 states. [2021-01-07 05:33:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,690 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-01-07 05:33:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:33:11,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2021-01-07 05:33:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,691 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:33:11,691 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:33:11,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:33:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:33:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-01-07 05:33:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-01-07 05:33:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-01-07 05:33:11,695 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 38 [2021-01-07 05:33:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,695 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-01-07 05:33:11,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:33:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2021-01-07 05:33:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:33:11,696 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,696 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, 1, 1, 1, 1, 1] [2021-01-07 05:33:11,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:33:11,696 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -872495077, now seen corresponding path program 1 times [2021-01-07 05:33:11,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926104382] [2021-01-07 05:33:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:11,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926104382] [2021-01-07 05:33:11,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:11,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:11,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867369252] [2021-01-07 05:33:11,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:11,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:11,756 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2021-01-07 05:33:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,947 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2021-01-07 05:33:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:11,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2021-01-07 05:33:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,949 INFO L225 Difference]: With dead ends: 113 [2021-01-07 05:33:11,949 INFO L226 Difference]: Without dead ends: 113 [2021-01-07 05:33:11,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-01-07 05:33:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2021-01-07 05:33:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:33:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2021-01-07 05:33:11,952 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 40 [2021-01-07 05:33:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,952 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2021-01-07 05:33:11,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2021-01-07 05:33:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:33:11,953 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,953 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, 1, 1, 1, 1, 1] [2021-01-07 05:33:11,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:33:11,954 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash -872495076, now seen corresponding path program 1 times [2021-01-07 05:33:11,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402515747] [2021-01-07 05:33:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:12,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402515747] [2021-01-07 05:33:12,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:12,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:12,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758874475] [2021-01-07 05:33:12,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:12,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:12,056 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 6 states. [2021-01-07 05:33:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:12,272 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-01-07 05:33:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:12,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2021-01-07 05:33:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:12,274 INFO L225 Difference]: With dead ends: 94 [2021-01-07 05:33:12,274 INFO L226 Difference]: Without dead ends: 94 [2021-01-07 05:33:12,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-01-07 05:33:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-01-07 05:33:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:33:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-01-07 05:33:12,277 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 40 [2021-01-07 05:33:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:12,278 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-01-07 05:33:12,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-01-07 05:33:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:33:12,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:12,278 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, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:12,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:33:12,279 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1277543510, now seen corresponding path program 1 times [2021-01-07 05:33:12,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:12,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176722741] [2021-01-07 05:33:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:12,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176722741] [2021-01-07 05:33:12,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987234140] [2021-01-07 05:33:12,766 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 [2021-01-07 05:33:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 80 conjunts are in the unsatisfiable core [2021-01-07 05:33:13,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:13,020 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:33:13,021 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 1 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:13,022 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:13,031 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2021-01-07 05:33:13,203 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:13,203 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 [2021-01-07 05:33:13,208 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,246 INFO L625 ElimStorePlain]: treesize reduction 28, result has 47.2 percent of original size [2021-01-07 05:33:13,247 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,248 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2021-01-07 05:33:13,551 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:33:13,552 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:13,568 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2021-01-07 05:33:13,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:13,839 INFO L348 Elim1Store]: treesize reduction 26, result has 87.3 percent of original size [2021-01-07 05:33:13,839 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 201 [2021-01-07 05:33:13,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:13,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:13,855 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:13,884 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. [2021-01-07 05:33:13,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:90 [2021-01-07 05:33:13,992 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_55|], 6=[|v_#memory_$Pointer$.base_56|]} [2021-01-07 05:33:13,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,000 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 63 treesize of output 50 [2021-01-07 05:33:14,002 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:14,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,064 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,065 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 2 case distinctions, treesize of input 66 treesize of output 91 [2021-01-07 05:33:14,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:14,072 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:14,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:14,108 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:112, output treesize:104 [2021-01-07 05:33:14,222 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_56|], 12=[|v_#memory_$Pointer$.base_57|]} [2021-01-07 05:33:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,232 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 72 treesize of output 62 [2021-01-07 05:33:14,234 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:14,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,319 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,320 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 125 [2021-01-07 05:33:14,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:33:14,327 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:33:14,331 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:14,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,377 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:14,378 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:130, output treesize:122 [2021-01-07 05:33:14,496 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_57|], 20=[|v_#memory_$Pointer$.base_58|]} [2021-01-07 05:33:14,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,509 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 65 [2021-01-07 05:33:14,512 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:14,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:14,630 INFO L348 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2021-01-07 05:33:14,631 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 118 [2021-01-07 05:33:14,637 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:33:14,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:33:14,639 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:33:14,643 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:14,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:14,684 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:14,684 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:122 [2021-01-07 05:33:15,839 INFO L443 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 30=[|#memory_$Pointer$.base|]} [2021-01-07 05:33:15,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:15,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:15,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:15,848 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 58 [2021-01-07 05:33:15,851 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:15,895 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:15,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:15,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:15,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:15,968 INFO L348 Elim1Store]: treesize reduction 10, result has 87.3 percent of original size [2021-01-07 05:33:15,968 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 105 [2021-01-07 05:33:15,972 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:15,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:16,002 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:16,002 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:156, output treesize:40 [2021-01-07 05:33:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:16,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:16,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [19] total 41 [2021-01-07 05:33:16,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872677368] [2021-01-07 05:33:16,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-07 05:33:16,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:16,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-07 05:33:16,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:33:16,263 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 24 states. [2021-01-07 05:33:19,790 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-07 05:33:20,147 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2021-01-07 05:33:20,552 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2021-01-07 05:33:20,961 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2021-01-07 05:33:21,375 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 106 [2021-01-07 05:33:21,865 WARN L197 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2021-01-07 05:33:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:22,583 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2021-01-07 05:33:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:33:22,584 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2021-01-07 05:33:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:22,585 INFO L225 Difference]: With dead ends: 111 [2021-01-07 05:33:22,585 INFO L226 Difference]: Without dead ends: 111 [2021-01-07 05:33:22,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=528, Invalid=2893, Unknown=1, NotChecked=0, Total=3422 [2021-01-07 05:33:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-01-07 05:33:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2021-01-07 05:33:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:33:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2021-01-07 05:33:22,590 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 41 [2021-01-07 05:33:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:22,590 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2021-01-07 05:33:22,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-07 05:33:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2021-01-07 05:33:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:33:22,591 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:22,591 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, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:22,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 05:33:22,792 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1277543509, now seen corresponding path program 1 times [2021-01-07 05:33:22,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:22,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280111902] [2021-01-07 05:33:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:23,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280111902] [2021-01-07 05:33:23,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087525249] [2021-01-07 05:33:23,507 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 [2021-01-07 05:33:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:23,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 85 conjunts are in the unsatisfiable core [2021-01-07 05:33:23,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:23,676 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:33:23,676 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 1 case distinctions, treesize of input 9 treesize of output 11 [2021-01-07 05:33:23,677 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:23,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:23,686 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:23,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2021-01-07 05:33:23,865 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:23,866 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 [2021-01-07 05:33:23,868 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:23,913 INFO L625 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2021-01-07 05:33:23,914 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:23,914 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2021-01-07 05:33:24,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:33:24,440 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:24,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:24,472 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:33:24,473 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:24,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:24,499 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:24,499 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:62 [2021-01-07 05:33:24,711 INFO L443 ElimStorePlain]: Different costs {1=[|v_#length_79|], 6=[|v_#valid_102|]} [2021-01-07 05:33:24,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:24,718 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 42 treesize of output 44 [2021-01-07 05:33:24,720 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:24,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:24,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:24,793 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:24,794 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 107 [2021-01-07 05:33:24,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:24,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:24,799 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:24,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:24,828 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:24,828 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:109 [2021-01-07 05:33:24,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:24,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:24,980 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:24,980 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 2 case distinctions, treesize of input 90 treesize of output 111 [2021-01-07 05:33:24,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:24,986 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:25,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,039 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,040 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 96 treesize of output 87 [2021-01-07 05:33:25,042 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:25,109 INFO L625 ElimStorePlain]: treesize reduction 40, result has 75.5 percent of original size [2021-01-07 05:33:25,112 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:25,112 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:131, output treesize:123 [2021-01-07 05:33:25,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,283 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,283 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 145 [2021-01-07 05:33:25,287 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:33:25,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:33:25,290 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:25,335 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,352 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,352 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2021-01-07 05:33:25,355 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:25,436 INFO L625 ElimStorePlain]: treesize reduction 40, result has 77.9 percent of original size [2021-01-07 05:33:25,439 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:25,439 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:149, output treesize:141 [2021-01-07 05:33:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,617 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,618 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 102 [2021-01-07 05:33:25,621 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:25,726 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2021-01-07 05:33:25,727 INFO L625 ElimStorePlain]: treesize reduction 40, result has 80.0 percent of original size [2021-01-07 05:33:25,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:25,802 INFO L348 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2021-01-07 05:33:25,803 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 138 [2021-01-07 05:33:25,806 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:33:25,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:33:25,808 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:33:25,811 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:25,853 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:25,856 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:25,856 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:141 [2021-01-07 05:33:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:26,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:26,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:26,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:26,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:26,906 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:26,906 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 113 [2021-01-07 05:33:26,909 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:33:26,910 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:33:26,912 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:33:26,919 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:33:26,920 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:33:26,922 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:33:26,924 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:27,014 INFO L625 ElimStorePlain]: treesize reduction 36, result has 72.9 percent of original size [2021-01-07 05:33:27,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:27,019 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:178, output treesize:97 [2021-01-07 05:33:27,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:27,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:27,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:27,417 INFO L348 Elim1Store]: treesize reduction 10, result has 87.3 percent of original size [2021-01-07 05:33:27,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 102 [2021-01-07 05:33:27,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:27,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:27,452 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:27,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:104, output treesize:24 [2021-01-07 05:33:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:27,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:27,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 43 [2021-01-07 05:33:27,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969169339] [2021-01-07 05:33:27,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-07 05:33:27,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-07 05:33:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1774, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:33:27,691 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 44 states. [2021-01-07 05:33:28,952 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-01-07 05:33:29,387 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-07 05:33:29,687 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2021-01-07 05:33:34,167 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 119 [2021-01-07 05:33:38,741 WARN L197 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 123 [2021-01-07 05:33:39,147 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2021-01-07 05:33:43,735 WARN L197 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 134 DAG size of output: 126 [2021-01-07 05:33:48,266 WARN L197 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 156 DAG size of output: 118 [2021-01-07 05:33:50,826 WARN L197 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 171 DAG size of output: 118 [2021-01-07 05:33:53,516 WARN L197 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 192 DAG size of output: 148 [2021-01-07 05:33:59,709 WARN L197 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 178 DAG size of output: 149 [2021-01-07 05:34:02,520 WARN L197 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 186 DAG size of output: 156 [2021-01-07 05:34:02,926 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2021-01-07 05:34:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:04,296 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2021-01-07 05:34:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-07 05:34:04,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 41 [2021-01-07 05:34:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:04,299 INFO L225 Difference]: With dead ends: 110 [2021-01-07 05:34:04,299 INFO L226 Difference]: Without dead ends: 110 [2021-01-07 05:34:04,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=528, Invalid=3630, Unknown=2, NotChecked=0, Total=4160 [2021-01-07 05:34:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-01-07 05:34:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2021-01-07 05:34:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:34:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-01-07 05:34:04,304 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 41 [2021-01-07 05:34:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:04,305 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-01-07 05:34:04,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-07 05:34:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-01-07 05:34:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:34:04,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:04,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:04,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:04,519 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2144419984, now seen corresponding path program 1 times [2021-01-07 05:34:04,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:04,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045459526] [2021-01-07 05:34:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:05,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045459526] [2021-01-07 05:34:05,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:05,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-01-07 05:34:05,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509397163] [2021-01-07 05:34:05,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-07 05:34:05,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-07 05:34:05,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:34:05,658 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 21 states. [2021-01-07 05:34:06,786 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2021-01-07 05:34:06,988 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-01-07 05:34:07,146 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-01-07 05:34:07,553 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2021-01-07 05:34:07,999 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 70 [2021-01-07 05:34:08,367 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 70 [2021-01-07 05:34:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:08,541 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-01-07 05:34:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:34:08,542 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2021-01-07 05:34:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:08,543 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:34:08,543 INFO L226 Difference]: Without dead ends: 92 [2021-01-07 05:34:08,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2021-01-07 05:34:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-01-07 05:34:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2021-01-07 05:34:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:34:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2021-01-07 05:34:08,546 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 45 [2021-01-07 05:34:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:08,547 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2021-01-07 05:34:08,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-07 05:34:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2021-01-07 05:34:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 05:34:08,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:08,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:08,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 05:34:08,548 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2144419983, now seen corresponding path program 1 times [2021-01-07 05:34:08,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:08,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497009555] [2021-01-07 05:34:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:09,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497009555] [2021-01-07 05:34:09,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:09,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-01-07 05:34:09,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755578847] [2021-01-07 05:34:09,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-07 05:34:09,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-07 05:34:09,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-01-07 05:34:09,464 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 20 states. [2021-01-07 05:34:10,644 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-01-07 05:34:10,845 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2021-01-07 05:34:11,023 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2021-01-07 05:34:11,192 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2021-01-07 05:34:11,359 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2021-01-07 05:34:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:11,563 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2021-01-07 05:34:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:34:11,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2021-01-07 05:34:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:11,565 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:34:11,565 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:34:11,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:34:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:34:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2021-01-07 05:34:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:34:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-01-07 05:34:11,569 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 45 [2021-01-07 05:34:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:11,570 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-01-07 05:34:11,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-07 05:34:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-01-07 05:34:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:34:11,570 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:11,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:11,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:34:11,571 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash -796694591, now seen corresponding path program 1 times [2021-01-07 05:34:11,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:11,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013942490] [2021-01-07 05:34:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:12,249 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2021-01-07 05:34:12,391 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2021-01-07 05:34:12,829 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2021-01-07 05:34:13,278 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-01-07 05:34:13,491 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2021-01-07 05:34:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:13,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013942490] [2021-01-07 05:34:13,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:13,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-01-07 05:34:13,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079713659] [2021-01-07 05:34:13,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:34:13,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:34:13,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:34:13,869 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 25 states. [2021-01-07 05:34:14,915 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2021-01-07 05:34:15,180 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-01-07 05:34:15,417 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-01-07 05:34:15,707 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2021-01-07 05:34:16,100 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-01-07 05:34:16,442 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-01-07 05:34:16,814 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 85 [2021-01-07 05:34:17,331 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 91 [2021-01-07 05:34:17,722 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 91 [2021-01-07 05:34:18,108 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 93 [2021-01-07 05:34:18,675 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2021-01-07 05:34:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:18,826 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-01-07 05:34:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:34:18,827 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2021-01-07 05:34:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:18,828 INFO L225 Difference]: With dead ends: 105 [2021-01-07 05:34:18,828 INFO L226 Difference]: Without dead ends: 105 [2021-01-07 05:34:18,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:34:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-01-07 05:34:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2021-01-07 05:34:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:34:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2021-01-07 05:34:18,832 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 47 [2021-01-07 05:34:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:18,832 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2021-01-07 05:34:18,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:34:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2021-01-07 05:34:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:34:18,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:18,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:18,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:34:18,834 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1119335660, now seen corresponding path program 1 times [2021-01-07 05:34:18,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:18,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563263652] [2021-01-07 05:34:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:19,721 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-01-07 05:34:20,008 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2021-01-07 05:34:20,263 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 36 [2021-01-07 05:34:20,653 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2021-01-07 05:34:21,739 WARN L197 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2021-01-07 05:34:22,129 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2021-01-07 05:34:22,375 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2021-01-07 05:34:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:22,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563263652] [2021-01-07 05:34:22,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:22,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-01-07 05:34:22,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899034007] [2021-01-07 05:34:22,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:34:22,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:34:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:34:22,692 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 25 states. [2021-01-07 05:34:24,129 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-01-07 05:34:24,314 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2021-01-07 05:34:24,549 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-01-07 05:34:24,784 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-01-07 05:34:24,998 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2021-01-07 05:34:25,277 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2021-01-07 05:34:25,558 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2021-01-07 05:34:25,908 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2021-01-07 05:34:26,872 WARN L197 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 112 [2021-01-07 05:34:27,621 WARN L197 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 99 [2021-01-07 05:34:28,272 WARN L197 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 93 [2021-01-07 05:34:28,962 WARN L197 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 100 [2021-01-07 05:34:29,671 WARN L197 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 100 [2021-01-07 05:34:30,359 WARN L197 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 102 [2021-01-07 05:34:31,069 WARN L197 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 105 [2021-01-07 05:34:31,751 WARN L197 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 96 [2021-01-07 05:34:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:32,260 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2021-01-07 05:34:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:34:32,262 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2021-01-07 05:34:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:32,263 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:34:32,263 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:34:32,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=530, Invalid=1632, Unknown=0, NotChecked=0, Total=2162 [2021-01-07 05:34:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:34:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2021-01-07 05:34:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-01-07 05:34:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-01-07 05:34:32,267 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 49 [2021-01-07 05:34:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:32,267 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-01-07 05:34:32,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:34:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-01-07 05:34:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 05:34:32,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:32,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:32,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:34:32,268 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:32,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1119335659, now seen corresponding path program 1 times [2021-01-07 05:34:32,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:32,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898091469] [2021-01-07 05:34:32,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:33,496 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-01-07 05:34:33,747 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-01-07 05:34:34,245 WARN L197 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2021-01-07 05:34:34,892 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2021-01-07 05:34:35,767 WARN L197 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2021-01-07 05:34:36,277 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-01-07 05:34:36,842 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2021-01-07 05:34:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:37,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898091469] [2021-01-07 05:34:37,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:37,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-01-07 05:34:37,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017669132] [2021-01-07 05:34:37,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-07 05:34:37,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-07 05:34:37,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:34:37,258 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 26 states. [2021-01-07 05:34:38,557 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2021-01-07 05:34:38,942 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2021-01-07 05:34:39,201 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2021-01-07 05:34:39,513 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2021-01-07 05:34:40,010 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2021-01-07 05:34:40,509 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2021-01-07 05:34:41,135 WARN L197 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2021-01-07 05:34:42,288 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 203 DAG size of output: 148 [2021-01-07 05:34:44,397 WARN L197 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 236 DAG size of output: 156 [2021-01-07 05:34:46,560 WARN L197 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 245 DAG size of output: 165 [2021-01-07 05:34:48,711 WARN L197 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 245 DAG size of output: 165 [2021-01-07 05:34:50,898 WARN L197 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 250 DAG size of output: 170 [2021-01-07 05:34:52,981 WARN L197 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 241 DAG size of output: 161 [2021-01-07 05:34:55,218 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 205 DAG size of output: 111 [2021-01-07 05:34:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:55,516 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-01-07 05:34:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:34:55,517 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2021-01-07 05:34:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:55,518 INFO L225 Difference]: With dead ends: 111 [2021-01-07 05:34:55,518 INFO L226 Difference]: Without dead ends: 111 [2021-01-07 05:34:55,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=394, Invalid=1586, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:34:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-01-07 05:34:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-01-07 05:34:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:34:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2021-01-07 05:34:55,522 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 49 [2021-01-07 05:34:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:55,523 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2021-01-07 05:34:55,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-07 05:34:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2021-01-07 05:34:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:34:55,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:55,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:55,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 05:34:55,524 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1939740969, now seen corresponding path program 1 times [2021-01-07 05:34:55,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:55,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824467929] [2021-01-07 05:34:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:56,599 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-01-07 05:34:57,201 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-01-07 05:34:58,011 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-01-07 05:34:58,262 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 05:34:58,515 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2021-01-07 05:34:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:59,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824467929] [2021-01-07 05:34:59,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075929025] [2021-01-07 05:34:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:59,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 143 conjunts are in the unsatisfiable core [2021-01-07 05:34:59,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:59,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-01-07 05:34:59,525 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:59,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:59,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:59,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2021-01-07 05:34:59,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:59,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:59,996 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:59,996 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 47 [2021-01-07 05:34:59,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,001 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:00,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2021-01-07 05:35:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:35:00,404 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:00,445 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2021-01-07 05:35:01,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:01,021 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 [2021-01-07 05:35:01,022 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,061 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2021-01-07 05:35:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 05:35:01,083 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,121 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2021-01-07 05:35:01,529 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 [2021-01-07 05:35:01,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,567 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:47 [2021-01-07 05:35:01,579 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_63|], 2=[|v_#memory_int_50|]} [2021-01-07 05:35:01,588 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:35:01,589 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:01,651 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 29 treesize of output 13 [2021-01-07 05:35:01,654 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:01,694 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,694 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:65 [2021-01-07 05:35:02,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,147 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,147 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2021-01-07 05:35:02,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:02,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,153 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,205 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,205 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:137, output treesize:125 [2021-01-07 05:35:02,441 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_51|, |v_#memory_$Pointer$.offset_62|], 6=[|v_#memory_$Pointer$.base_64|]} [2021-01-07 05:35:02,450 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 33 treesize of output 21 [2021-01-07 05:35:02,452 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,548 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 102 treesize of output 81 [2021-01-07 05:35:02,553 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:02,637 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,637 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 66 [2021-01-07 05:35:02,639 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,701 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,701 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:165, output treesize:142 [2021-01-07 05:35:02,992 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_52|], 6=[|v_#memory_$Pointer$.offset_63|], 12=[|v_#memory_$Pointer$.base_65|]} [2021-01-07 05:35:03,003 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 37 treesize of output 21 [2021-01-07 05:35:03,005 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,108 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-01-07 05:35:03,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,120 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 111 treesize of output 93 [2021-01-07 05:35:03,123 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:03,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,235 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 100 [2021-01-07 05:35:03,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:03,240 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,318 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,318 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:187, output treesize:160 [2021-01-07 05:35:03,627 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_53|], 12=[|v_#memory_$Pointer$.offset_64|], 20=[|v_#memory_$Pointer$.base_66|]} [2021-01-07 05:35:03,638 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 31 treesize of output 30 [2021-01-07 05:35:03,639 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,761 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-07 05:35:03,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,781 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 96 [2021-01-07 05:35:03,783 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,888 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:35:03,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:03,913 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 89 [2021-01-07 05:35:03,918 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,011 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,012 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:211, output treesize:160 [2021-01-07 05:35:05,310 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2021-01-07 05:35:05,690 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 05:35:06,055 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 05:35:06,449 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-01-07 05:35:06,848 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-01-07 05:35:06,864 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_54|], 20=[|v_#memory_$Pointer$.offset_65|], 42=[|v_#memory_$Pointer$.base_67|]} [2021-01-07 05:35:06,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:06,877 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 33 treesize of output 21 [2021-01-07 05:35:06,878 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,021 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-07 05:35:07,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:07,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:07,036 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 112 [2021-01-07 05:35:07,039 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,150 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-07 05:35:07,150 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:07,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:07,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:07,191 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:07,191 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 115 [2021-01-07 05:35:07,196 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:07,297 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,298 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:228, output treesize:110 [2021-01-07 05:35:07,661 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_55|], 12=[|v_#memory_$Pointer$.offset_66|], 20=[|v_#memory_$Pointer$.base_68|]} [2021-01-07 05:35:07,671 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-01-07 05:35:07,673 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,796 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:35:07,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,812 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-01-07 05:35:07,816 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:07,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:07,927 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 45 [2021-01-07 05:35:07,930 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:08,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:08,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:08,026 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:147, output treesize:110 [2021-01-07 05:35:08,390 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_56|], 12=[|v_#memory_$Pointer$.offset_67|], 20=[|v_#memory_$Pointer$.base_69|]} [2021-01-07 05:35:08,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,400 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 21 [2021-01-07 05:35:08,401 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:08,506 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-07 05:35:08,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:08,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,522 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2021-01-07 05:35:08,525 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:08,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:08,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:08,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:08,657 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:08,658 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 114 [2021-01-07 05:35:08,662 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:08,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:08,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:08,753 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:221, output treesize:149 [2021-01-07 05:35:09,122 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 20=[|v_#memory_$Pointer$.base_70|, |v_#memory_$Pointer$.offset_68|]} [2021-01-07 05:35:09,133 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-01-07 05:35:09,134 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,240 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-07 05:35:09,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:09,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:09,297 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:09,297 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 145 [2021-01-07 05:35:09,301 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,412 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:35:09,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:09,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,441 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2021-01-07 05:35:09,443 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:09,536 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,537 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:163 [2021-01-07 05:35:09,926 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_58|], 30=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_69|]} [2021-01-07 05:35:09,935 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 37 [2021-01-07 05:35:09,937 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:10,066 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-07 05:35:10,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:10,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:10,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:10,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:10,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:10,327 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2021-01-07 05:35:10,328 INFO L348 Elim1Store]: treesize reduction 12, result has 93.6 percent of original size [2021-01-07 05:35:10,328 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 303 treesize of output 346 [2021-01-07 05:35:10,342 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:10,548 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2021-01-07 05:35:10,549 INFO L625 ElimStorePlain]: treesize reduction 20, result has 93.6 percent of original size [2021-01-07 05:35:10,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:10,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:10,722 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-01-07 05:35:10,724 INFO L348 Elim1Store]: treesize reduction 16, result has 88.1 percent of original size [2021-01-07 05:35:10,724 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 255 treesize of output 265 [2021-01-07 05:35:10,730 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:10,731 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:10,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:10,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:10,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:10,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:10,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:10,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:10,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:10,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:10,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:10,739 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:10,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:10,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:10,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:10,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:10,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:10,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:10,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:10,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:10,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:10,752 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:10,942 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2021-01-07 05:35:10,943 INFO L625 ElimStorePlain]: treesize reduction 174, result has 60.7 percent of original size [2021-01-07 05:35:10,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:10,946 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:378, output treesize:333 [2021-01-07 05:35:12,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:12,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:12,146 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,146 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 343 treesize of output 272 [2021-01-07 05:35:12,153 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:35:12,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:35:12,155 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:35:12,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:35:12,157 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:35:12,159 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:12,159 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:12,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:35:12,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:12,163 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:35:12,163 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:35:12,166 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:35:12,168 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:12,169 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:12,170 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-07 05:35:12,172 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:35:12,174 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:12,175 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-07 05:35:12,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:12,183 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:35:12,184 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:12,185 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-07 05:35:12,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:12,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:35:12,199 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:12,343 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-01-07 05:35:12,343 INFO L625 ElimStorePlain]: treesize reduction 17, result has 89.2 percent of original size [2021-01-07 05:35:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:12,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:12,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:12,361 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,362 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 55 [2021-01-07 05:35:12,368 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:12,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,408 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:12,408 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:363, output treesize:16 [2021-01-07 05:35:12,659 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 [2021-01-07 05:35:12,660 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:12,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:12,663 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:12,664 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-07 05:35:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:35:12,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:35:12,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 65 [2021-01-07 05:35:12,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090975641] [2021-01-07 05:35:12,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-01-07 05:35:12,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-01-07 05:35:12,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=4002, Unknown=0, NotChecked=0, Total=4160 [2021-01-07 05:35:12,705 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 65 states. [2021-01-07 05:35:13,728 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2021-01-07 05:35:14,020 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-01-07 05:35:14,492 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-01-07 05:35:14,863 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2021-01-07 05:35:15,348 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2021-01-07 05:35:16,043 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2021-01-07 05:35:16,727 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2021-01-07 05:35:17,497 WARN L197 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2021-01-07 05:35:18,613 WARN L197 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 132 [2021-01-07 05:35:19,852 WARN L197 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 137 [2021-01-07 05:35:20,753 WARN L197 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 107 [2021-01-07 05:35:21,458 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2021-01-07 05:35:22,323 WARN L197 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 106 [2021-01-07 05:35:23,427 WARN L197 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 126 [2021-01-07 05:35:24,661 WARN L197 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 133 [2021-01-07 05:35:25,892 WARN L197 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 141 [2021-01-07 05:35:27,141 WARN L197 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 134 [2021-01-07 05:35:28,436 WARN L197 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 138 [2021-01-07 05:35:29,866 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 216 DAG size of output: 138 [2021-01-07 05:35:30,689 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 96 [2021-01-07 05:35:33,148 WARN L197 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 200 DAG size of output: 106 [2021-01-07 05:35:36,382 WARN L197 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 208 DAG size of output: 114 [2021-01-07 05:35:40,766 WARN L197 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 212 DAG size of output: 117 [2021-01-07 05:35:46,240 WARN L197 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 213 DAG size of output: 134 [2021-01-07 05:35:52,805 WARN L197 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 219 DAG size of output: 150 [2021-01-07 05:36:00,165 WARN L197 SmtUtils]: Spent 5.81 s on a formula simplification. DAG size of input: 219 DAG size of output: 150 [2021-01-07 05:36:08,943 WARN L197 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 225 DAG size of output: 156 [2021-01-07 05:36:15,364 WARN L197 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 219 DAG size of output: 140 [2021-01-07 05:36:22,405 WARN L197 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 221 DAG size of output: 142 [2021-01-07 05:36:34,175 WARN L197 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 188 DAG size of output: 114 [2021-01-07 05:36:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:36:35,993 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-01-07 05:36:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-01-07 05:36:35,996 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 51 [2021-01-07 05:36:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:36:35,997 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:36:35,997 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:36:36,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 80.5s TimeCoverageRelationStatistics Valid=748, Invalid=8564, Unknown=0, NotChecked=0, Total=9312 [2021-01-07 05:36:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:36:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2021-01-07 05:36:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:36:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-01-07 05:36:36,004 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 51 [2021-01-07 05:36:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:36:36,004 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-01-07 05:36:36,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2021-01-07 05:36:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-01-07 05:36:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 05:36:36,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:36:36,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:36:36,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:36:36,207 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:36:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:36:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash 687427427, now seen corresponding path program 1 times [2021-01-07 05:36:36,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:36:36,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161755276] [2021-01-07 05:36:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:36:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:38,256 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-01-07 05:36:38,541 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2021-01-07 05:36:38,871 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-01-07 05:36:39,111 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-01-07 05:36:39,356 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2021-01-07 05:36:39,643 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2021-01-07 05:36:39,887 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-07 05:36:40,477 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2021-01-07 05:36:41,044 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2021-01-07 05:36:41,716 WARN L197 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-01-07 05:36:42,658 WARN L197 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2021-01-07 05:36:44,662 WARN L197 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2021-01-07 05:36:45,517 WARN L197 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2021-01-07 05:36:46,439 WARN L197 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2021-01-07 05:36:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:36:47,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161755276] [2021-01-07 05:36:47,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860815067] [2021-01-07 05:36:47,837 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 [2021-01-07 05:36:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 122 conjunts are in the unsatisfiable core [2021-01-07 05:36:48,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:36:48,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:48,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2021-01-07 05:36:48,034 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:48,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:48,058 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:48,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2021-01-07 05:36:48,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:48,703 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:48,703 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 [2021-01-07 05:36:48,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:36:48,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:48,711 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:48,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:48,754 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:48,754 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:39 [2021-01-07 05:36:49,675 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 [2021-01-07 05:36:49,677 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:49,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:49,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:49,728 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2021-01-07 05:36:49,990 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 21 treesize of output 20 [2021-01-07 05:36:49,993 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:50,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:50,050 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. [2021-01-07 05:36:50,051 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2021-01-07 05:36:50,642 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:50,642 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 28 treesize of output 52 [2021-01-07 05:36:50,645 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:50,783 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-01-07 05:36:50,785 INFO L625 ElimStorePlain]: treesize reduction 22, result has 73.8 percent of original size [2021-01-07 05:36:50,787 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. [2021-01-07 05:36:50,787 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2021-01-07 05:36:51,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:51,077 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:51,077 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 2 case distinctions, treesize of input 55 treesize of output 92 [2021-01-07 05:36:51,081 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:51,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:51,139 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. [2021-01-07 05:36:51,140 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:77 [2021-01-07 05:36:51,782 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_80|], 10=[|v_#valid_108|]} [2021-01-07 05:36:51,794 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 [2021-01-07 05:36:51,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:51,895 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:51,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:51,992 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:51,993 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 157 [2021-01-07 05:36:51,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:36:51,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:52,001 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:52,108 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-07 05:36:52,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:52,112 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:52,113 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:176, output treesize:193 [2021-01-07 05:36:52,510 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-01-07 05:36:52,536 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_70|], 20=[|v_#memory_$Pointer$.base_76|]} [2021-01-07 05:36:52,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:52,553 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 150 treesize of output 117 [2021-01-07 05:36:52,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:52,707 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-07 05:36:52,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:52,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:52,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:52,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:53,041 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-07 05:36:53,042 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:53,042 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 161 treesize of output 267 [2021-01-07 05:36:53,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:36:53,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:36:53,051 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:53,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:36:53,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:53,057 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:53,198 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 05:36:53,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:53,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:53,215 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:215, output treesize:217 [2021-01-07 05:36:53,754 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-01-07 05:36:53,782 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_71|], 30=[|v_#memory_$Pointer$.base_77|]} [2021-01-07 05:36:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:53,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:53,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 139 [2021-01-07 05:36:53,806 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:53,968 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-07 05:36:53,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:53,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:53,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:54,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:54,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:54,334 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-07 05:36:54,336 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:54,337 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 180 treesize of output 339 [2021-01-07 05:36:54,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:36:54,346 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 05:36:54,347 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:36:54,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:36:54,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:36:54,350 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:36:54,351 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:54,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:36:54,354 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:36:54,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:36:54,355 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:54,356 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:54,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:54,359 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:36:54,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:36:54,361 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:54,363 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:54,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:54,369 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:54,513 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:36:54,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:54,519 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:54,520 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:243, output treesize:225 [2021-01-07 05:36:54,993 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-07 05:36:55,010 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_72|], 42=[|v_#memory_$Pointer$.base_78|]} [2021-01-07 05:36:55,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,038 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 132 [2021-01-07 05:36:55,042 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:55,217 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-01-07 05:36:55,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:55,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:55,908 WARN L197 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2021-01-07 05:36:55,910 INFO L348 Elim1Store]: treesize reduction 96, result has 71.9 percent of original size [2021-01-07 05:36:55,910 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 185 treesize of output 318 [2021-01-07 05:36:55,917 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2021-01-07 05:36:55,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:36:55,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:36:55,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:36:55,920 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:36:55,921 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:36:55,922 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:36:55,925 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:55,926 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:55,929 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:36:55,930 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:36:55,930 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:55,931 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:55,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:36:55,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:36:55,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:36:55,936 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:36:55,937 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:36:55,938 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:36:55,938 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:55,939 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:55,942 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:36:55,943 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:36:55,944 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:36:55,945 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:55,952 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:56,108 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-07 05:36:56,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:56,112 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:56,113 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:263, output treesize:225 [2021-01-07 05:36:56,574 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-01-07 05:36:57,044 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-01-07 05:36:57,533 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-01-07 05:36:58,191 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-01-07 05:36:58,710 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-07 05:36:59,240 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-07 05:36:59,801 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-07 05:37:00,391 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-01-07 05:37:00,952 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-01-07 05:37:00,974 INFO L443 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_73|], 72=[|v_#memory_$Pointer$.base_79|]} [2021-01-07 05:37:00,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:00,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:37:00,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:00,991 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 148 [2021-01-07 05:37:00,995 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:37:01,165 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-07 05:37:01,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:01,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:01,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:37:01,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:01,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:37:01,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:01,628 WARN L197 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-01-07 05:37:01,629 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:01,630 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 24 case distinctions, treesize of input 161 treesize of output 350 [2021-01-07 05:37:01,652 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:37:01,980 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-01-07 05:37:01,981 INFO L625 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size [2021-01-07 05:37:01,987 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. [2021-01-07 05:37:01,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:270, output treesize:155 [2021-01-07 05:37:02,520 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-01-07 05:37:02,536 INFO L443 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_74|], 42=[|v_#memory_$Pointer$.base_80|]} [2021-01-07 05:37:02,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:02,629 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:02,630 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 78 [2021-01-07 05:37:02,634 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:37:03,073 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2021-01-07 05:37:03,074 INFO L625 ElimStorePlain]: treesize reduction 38, result has 82.2 percent of original size [2021-01-07 05:37:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:03,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:03,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:03,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:37:03,353 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-01-07 05:37:03,355 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:03,356 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 245 [2021-01-07 05:37:03,367 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:37:03,812 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2021-01-07 05:37:03,815 INFO L625 ElimStorePlain]: treesize reduction 32, result has 85.0 percent of original size [2021-01-07 05:37:03,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:03,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:03,823 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:37:03,824 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:182 [2021-01-07 05:37:03,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:03,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:06,560 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-07 05:37:06,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:06,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:06,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:37:06,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:37:06,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:37:06,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 05:37:06,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:37:06,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2021-01-07 05:37:06,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:37:06,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:37:06,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 05:37:06,635 INFO L443 ElimStorePlain]: Different costs {42=[|v_#memory_$Pointer$.offset_75|], 90=[|v_#memory_$Pointer$.base_81|]} [2021-01-07 05:37:06,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:06,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:06,828 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:06,829 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 240 [2021-01-07 05:37:06,835 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:37:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:06,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:06,982 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:06,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 215 [2021-01-07 05:37:06,987 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:37:07,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:07,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:37:07,078 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:37:07,079 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 215 [2021-01-07 05:37:07,084 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.